Better Process Mapping and Sparse Quadratic Assignment
From MaRDI portal
Recommendations
- Better process mapping and sparse quadratic assignment
- High-quality hierarchical process mapping
- Mapping tasks onto nodes: a parallel local neighborhood approach
- Graph partitioning based methods and tools for scientific computing
- Improved schemes for mapping arbitrary algorithms onto processor meshes
Cites work
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 3326172 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Engineering Route Planning Algorithms
- Engineering multilevel graph partitioning algorithms
- Graph partitioning
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- P-Complete Approximation Problems
- The University of Florida sparse matrix collection
- The quadratic assignment problem. Theory and algorithms
Cited in
(6)- Algorithms and Data Structures
- On the performance of sparse process structures in partial postponement production systems
- Hierarchical mapping for HPC applications
- High-quality hierarchical process mapping
- Better process mapping and sparse quadratic assignment
- An MPI-based algorithm for mapping complex networks onto hierarchical architectures
This page was built for publication: Better Process Mapping and Sparse Quadratic Assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039926)