An MPI-based algorithm for mapping complex networks onto hierarchical architectures

DOI10.1007/978-3-030-85665-6_11MaRDI QIDQ6487189zbMATH OpenFDO

Authors Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke

Publication date 31 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85665-6_11

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• High-quality hierarchical process mapping
• Hierarchical mapping for HPC applications
• scientific article; zbMATH DE number 279005
• Better Process Mapping and Sparse Quadratic Assignment
• Parallel mapping of sparse computations

Cites work

• Better Process Mapping and Sparse Quadratic Assignment
• Distributed Evolutionary Graph Partitioning
• Emergence of Scaling in Random Networks
• High-quality hierarchical process mapping
• Parallel static and dynamic multi‐constraint graph partitioning
• Static mapping of process graphs
• The small-world phenomenon: an algorithmic perspective

Cited in

(3)

• Hierarchical mapping for HPC applications
• High-quality hierarchical process mapping
• FREIGHT: fast streaming hypergraph partitioning

This page was built for publication: An MPI-based algorithm for mapping complex networks onto hierarchical architectures

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