2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DC2020★ 1 cited
Efficient Process-to-Node Mapping Algorithms for Stencil Computations
Sascha Hunold, Konrad von Kirchbach, Markus Lehr +2
Good process-to-compute-node mappings can be decisive for well performing HPC applications. A special, important class of process-to-node mapping problems is the problem of mapping…
cs.DC2019★ 2 cited
Decomposing Collectives for Exploiting Multi-lane Communication
Jesper Larsson Träff
Many modern, high-performance systems increase the cumulated node-bandwidth by offering more than a single communication network and/or by having multiple connections to the networ…