One-dimensional partitioning for heterogeneous systems: theory and practice
DOI10.1016/J.JPDC.2008.07.005zbMATH Open1243.68073OpenAlexW2171296858MaRDI QIDQ436908FDOQ436908
Authors: Ali Pinar, E. Kartal Tabak, Cevdet Aykanat 
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22984
Recommendations
dynamic programmingparallel computingload balancingchain-on-chain partitioningone-dimensional partitioningparametric search
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- New challenges in dynamic load balancing
- Fast optimal load balancing algorithms for 1D partitioning
- Image-space decomposition algorithms for sort-first parallel volume rendering of unstructured grids
- Efficient partitioning of sequences
- Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Cited In (5)
- Automatic mesh refinement and parallel load balancing for Fokker-Planck-DSMC algorithm
- Load-balancing spatially located computations using rectangular partitions
- Dynamic load balancing for direct-coupled multiphysics simulations
- Fast optimal load balancing algorithms for 1D partitioning
- Optimal partitioning of random programs across two processors
Uses Software
This page was built for publication: One-dimensional partitioning for heterogeneous systems: theory and practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436908)
