Metraipolis › archive › dc_a00a02d8623a

Exploiting the Interplay of Compute- and Memory-Bound kernels in MPI Applications — arXiv:2610.01587

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01587
License (as archived)
CC0-1.0
Archived
2026-10-06T14:02:49.990Z
SHA-256 of the archived text
e818396682b5b03b1cdec34f55796e1537254a192dd1140f9f3e3ede0fde7339
Stable URL of this page
https://metraipolis.com/documento/dc_a00a02d8623a

How to cite

Exploiting the Interplay of Compute- and Memory-Bound kernels in MPI Applications — arXiv:2610.01587 — arXiv (en), https://arxiv.org/abs/2610.01587 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a00a02d8623a (Metraipolis archive dc_a00a02d8623a, sha256 e818396682b5b03b1cdec34f55796e1537254a192dd1140f9f3e3ede0fde7339)
BibTeX
@misc{dca00a02d8623a,
  title = {Exploiting the Interplay of Compute- and Memory-Bound kernels in MPI Applications — arXiv:2610.01587},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01587},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a00a02d8623a; sha256 e818396682b5b03b1cdec34f55796e1537254a192dd1140f9f3e3ede0fde7339},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01587. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Parallel applications are often designed for synchronous, lock-step execution, treating communication stalls as performance hazards. Yet, in a communication-light application without frequent synchronization points that alternates between compute-bound memory-bound execution, an MPI communication stall can act as an unintentional relief on memory-bandwidth contention. We demonstrate this using a Parallel Optical Flow Solver, which combines a compute-bound Ray Tracing kernel with a memory-bound Optical Flow Solver kernel and negligible inter-process communication. This program shows considerable speedup via desynchronization and automatic overlap between compute- and memory-bound phases, showing that natural desynchronization is an architecture-aware optimization. An optimal speedup is achieved when the number of processes concurrently executing the memory-bound phase on a ccNUMA domain is near the bandwidth saturation point. We also show a case where reducing communication overhead using MPI asynchronous progress significantly degrades performance because it allows too many ranks to contend for memory bandwidth simultaneously. In order to study the dynamics under more controlled conditions, we develop a tunable dual-kernel microbenchmark, with which we show that significant application or system noise (natural or injected) is required to achieve full desynchronization. Finally, we also validate these results using a bandwidth-aware, model-based simulator.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-02 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Performance (cs.PF).
Pagina del lavoro: https://arxiv.org/abs/2610.01587 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T12:22:22.559Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).