Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.19456 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911284314767360 |
|---|---|
| author | Reinhard, Anton Ehrig, Simeon Widera, René Bussmann, Michael Acosta, Uwe Hernandez |
| author_facet | Reinhard, Anton Ehrig, Simeon Widera, René Bussmann, Michael Acosta, Uwe Hernandez |
| contents | Complex computational problems in science often consist of smaller parts that can have largely distinct compute requirements from one another. For optimal efficiency, analyzing each subtask and scheduling it on the best-suited hardware would be necessary. Other considerations must be taken into account, too, such as parallelism, dependencies between different subtasks, and data transfer speeds between devices. To achieve this, directed acyclic graphs are often employed to represent these problems and enable utilizing as much hardware as possible on a given machine. In this paper, we present a software framework written in Julia capable of automatically and dynamically producing statically scheduled and compiled code. We lay theoretical foundations and add domain-specific information about the computation to the existing concepts of DAG scheduling, enabling optimizations that would otherwise be impossible. To illustrate the theory we implement an example application: the computation of matrix elements for scattering processes with many external particles in quantum electrodynamics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_19456 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimizations on Graph-Level for Domain Specific Computations in Julia and Application to QED Reinhard, Anton Ehrig, Simeon Widera, René Bussmann, Michael Acosta, Uwe Hernandez Distributed, Parallel, and Cluster Computing Performance Complex computational problems in science often consist of smaller parts that can have largely distinct compute requirements from one another. For optimal efficiency, analyzing each subtask and scheduling it on the best-suited hardware would be necessary. Other considerations must be taken into account, too, such as parallelism, dependencies between different subtasks, and data transfer speeds between devices. To achieve this, directed acyclic graphs are often employed to represent these problems and enable utilizing as much hardware as possible on a given machine. In this paper, we present a software framework written in Julia capable of automatically and dynamically producing statically scheduled and compiled code. We lay theoretical foundations and add domain-specific information about the computation to the existing concepts of DAG scheduling, enabling optimizations that would otherwise be impossible. To illustrate the theory we implement an example application: the computation of matrix elements for scattering processes with many external particles in quantum electrodynamics. |
| title | Optimizations on Graph-Level for Domain Specific Computations in Julia and Application to QED |
| topic | Distributed, Parallel, and Cluster Computing Performance |
| url | https://arxiv.org/abs/2511.19456 |