Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910213930483712 |
|---|---|
| author | Bhosale, Aditya Jain, Anant Goel, Shourya Rao, Ritvik Kumar, Peddoju Sateesh Kale, Laxmikant |
| author_facet | Bhosale, Aditya Jain, Anant Goel, Shourya Rao, Ritvik Kumar, Peddoju Sateesh Kale, Laxmikant |
| contents | Overdecomposition has emerged as a powerful and sometimes essential technique in parallel programming. Many application domains or frameworks, including those based on adaptive mesh refinements, or tree codes use it. Charm++ is a parallel programming system which has demonstrated the utility of overdecomposition for many applications and in multiple contexts. However, the emergence of GPGPUs as a dominant compute component has created some real and perceived challenges for this paradigm, especially regarding the higher overhead brought about by overpartitioning -- having multiple objects assigned to the same GPGPU device. We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_12734 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms Bhosale, Aditya Jain, Anant Goel, Shourya Rao, Ritvik Kumar, Peddoju Sateesh Kale, Laxmikant Distributed, Parallel, and Cluster Computing Overdecomposition has emerged as a powerful and sometimes essential technique in parallel programming. Many application domains or frameworks, including those based on adaptive mesh refinements, or tree codes use it. Charm++ is a parallel programming system which has demonstrated the utility of overdecomposition for many applications and in multiple contexts. However, the emergence of GPGPUs as a dominant compute component has created some real and perceived challenges for this paradigm, especially regarding the higher overhead brought about by overpartitioning -- having multiple objects assigned to the same GPGPU device. We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks. |
| title | Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.12734 |