One-dimensional partitioning for heterogeneous systems: theory and practice

DOI10.1016/j.jpdc.2008.07.005zbMath1243.68073OpenAlexW2171296858MaRDI QIDQ436908

Cevdet Aykanat, E. Kartal Tabak, Ali Pınar

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

zbMATH Keywords

dynamic programmingparallel computingload balancingparametric searchchain-on-chain partitioningone-dimensional partitioning

Mathematics Subject Classification ID

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)

Related Items (3)

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

Uses Software

• SparseMatrix
• Zoltan

Cites Work

• Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: One-dimensional partitioning for heterogeneous systems: theory and practice