Metraipolis › archive › dc_6718fb60c8f7
Data-Driven Prediction of Optimal MPI Rank Placement and Node Count for Memory-Bound CFD on AMD EPYC Clusters — arXiv:2610.23383
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.23383
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:44:25.503Z
- SHA-256 of the archived text
0539f207c81a391672bbd33f9b3fb5390801fd19d61c395a9facf2dcfda8769a- Stable URL of this page
https://metraipolis.com/documento/dc_6718fb60c8f7
How to cite
Data-Driven Prediction of Optimal MPI Rank Placement and Node Count for Memory-Bound CFD on AMD EPYC Clusters — arXiv:2610.23383 — arXiv (en), https://arxiv.org/abs/2610.23383 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6718fb60c8f7 (Metraipolis archive dc_6718fb60c8f7, sha256 0539f207c81a391672bbd33f9b3fb5390801fd19d61c395a9facf2dcfda8769a)
BibTeX
@misc{dc6718fb60c8f7,
title = {Data-Driven Prediction of Optimal MPI Rank Placement and Node Count for Memory-Bound CFD on AMD EPYC Clusters — arXiv:2610.23383},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.23383},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6718fb60c8f7; sha256 0539f207c81a391672bbd33f9b3fb5390801fd19d61c395a9facf2dcfda8769a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.23383. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Users who run a memory-bound OpenFOAM case on an AMD EPYC cluster must decide how many nodes to use and how many MPI ranks to place on each core complex. The fastest choice is often not the cheapest one. This paper revisits our earlier analytical model of this performance and energy trade-off with 560 measured configurations of the motorBike case on five Zen 4 and Zen 5 EPYC processors, including socket power from processor telemetry. On up to four nodes, small meshes are both fastest and cheapest on a single node on most processors. For the largest mesh the largest node count is both the fastest and the cheapest option, because its speedup is superlinear. A genuine trade-off arises only for medium meshes, where full speed costs a median of 20 to 97% more node hours than the cheapest option. The L3 miss rate and the halo traffic per cell are consistent with this pattern. For a new mesh of the same case, the configuration that was optimal on the nearest measured mesh is near optimal in 75 to 85% of the decisions. Running the two configurations it recommends for speed and for cost raises this share to 85 to 90% for runtime and node hours and determines the trade-off with median errors of 3 to 5 percentage points. Neither gradient boosted trees trained on the same data nor the earlier polynomial model improves on this simple procedure. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.PF, nuovi lavori del giorno). Categorie arXiv: Performance (cs.PF) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.23383 — 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-19T08:40:09.820Z dalla pagina https://arxiv.org/list/cs.PF/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).