Fast optimal load balancing algorithms for 1D partitioning

DOI10.1016/J.JPDC.2004.05.003MaRDI QIDQ1886606zbMATH OpenOpenAlexFDO

Authors Ali Pinar, Cevdet Aykanat

Publication date 18 November 2004

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/24250

zbMATH Keywords

Dynamic programmingParametric searchChains-on-chains partitioningImage-space parallel volume renderingIterative refinementOne-dimensional partitioningOptimal load balancingParallel sparse matrix vector multiplication

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• One-dimensional partitioning for heterogeneous systems: theory and practice
• Load-balancing spatially located computations using rectangular partitions
• Efficient array partitioning
• scientific article; zbMATH DE number 1215254
• Exact dynamic load balancing of MIMD architectures with linear programming algorithms

Cited in

(12)

• Parallel implementations of streamline simulators
• Complexity results for throughput and latency optimization of replicated and data-parallel workflows
• Two-constraint domain decomposition with space filling curves
• Mapping pipeline skeletons onto heterogeneous platforms
• One-dimensional partitioning for heterogeneous systems: theory and practice
• Automatic mesh refinement and parallel load balancing for Fokker-Planck-DSMC algorithm
• Load-balancing spatially located computations using rectangular partitions
• Coarse mesh partitioning for tree-based AMR
• Dynamic load balancing for direct-coupled multiphysics simulations
• An efficient hp-adaptive strategy for a level-set ghost-fluid method
• Parallel Eulerian-Lagrangian coupling method on hierarchical meshes
• An explicit local space-time adaptive framework for monodomain models in cardiac electrophysiology

This page was built for publication: Fast optimal load balancing algorithms for 1D partitioning

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