Static mapping of process graphs

MaRDI QIDQ2912417zbMATH OpenFDO

Authors François Pellegrini

Publication date 14 September 2012

zbMATH Keywords

graph partitioning problemnon-homogeneous parallel architecturestatic mapping

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 5180
• Graph generation to statically represent CSP processes
• scientific article; zbMATH DE number 919845
• scientific article; zbMATH DE number 1696537
• scientific article; zbMATH DE number 2079810
• scientific article; zbMATH DE number 522842

Cited in

(8)

• Mapping parallel programs to multiprocessors: A dynamic approach
• Graph partitioning based methods and tools for scientific computing
• scientific article; zbMATH DE number 1206094 (Why is no real title available?)
• scientific article; zbMATH DE number 2079810 (Why is no real title available?)
• scientific article; zbMATH DE number 2243645 (Why is no real title available?)
• A layered method for process and code mapping
• An MPI-based algorithm for mapping complex networks onto hierarchical architectures
• High-quality hierarchical process mapping

This page was built for publication: Static mapping of process graphs

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