High-quality hierarchical process mapping

DOI10.4230/LIPICS.SEA.2020.4MaRDI QIDQ6487599zbMATH OpenFDO

Authors Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.SEA.2020.4

zbMATH Keywords

algorithm engineeringgraph partitioningprocess mapping

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• An MPI-based algorithm for mapping complex networks onto hierarchical architectures
• Better process mapping and sparse quadratic assignment
• Better Process Mapping and Sparse Quadratic Assignment
• Graph partitioning based methods and tools for scientific computing
• Static mapping of process graphs

Cited in

(7)

• Graph partitioning based methods and tools for scientific computing
• Hierarchical mapping for HPC applications
• Better process mapping and sparse quadratic assignment
• Tree-based coarsening and partitioning of complex networks
• Better Process Mapping and Sparse Quadratic Assignment
• An MPI-based algorithm for mapping complex networks onto hierarchical architectures
• FREIGHT: fast streaming hypergraph partitioning

This page was built for publication: High-quality hierarchical process mapping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487599)