Fast optimal load balancing algorithms for 1D partitioning

DOI10.1016/j.jpdc.2004.05.003zbMath1068.68038OpenAlexW2103660617MaRDI QIDQ1886606

Ali Pınar, 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)

Related Items (11)

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

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