One-dimensional partitioning for heterogeneous systems: Theory and practice

Authors:
Ali Pınar;E. Kartal Tabak;Cevdet Aykanat
Affiliations:
High Performance Computing Research Department. Lawrence Berkeley National Laboratory, United States;Department of Computer Engineering, Bilkent University, Turkey;Department of Computer Engineering, Bilkent University, Turkey
Venue:
Journal of Parallel and Distributed Computing
Year:
2008

Citing 14
Cited 3

Introduction to algorithms

Introduction to algorithms
Raytracing irregular volume data

VVS '90 Proceedings of the 1990 workshop on Volume visualization
A polygonal approximation to direct scalar volume rendering

VVS '90 Proceedings of the 1990 workshop on Volume visualization
Rectilinear partitioning of irregular data parallel computations

Journal of Parallel and Distributed Computing
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

IEEE Transactions on Parallel and Distributed Systems
Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids

The Journal of Supercomputing
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Efficient Partitioning of Sequences

IEEE Transactions on Computers
Heuristics for 1D Rectilinear Partitioning as a Low Cost and High Quality Answer to Dynamic Load Balancing

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Sparse Matrix Decomposition with Optimal Load Balancing

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Fast optimal load balancing algorithms for 1D partitioning

Journal of Parallel and Distributed Computing
New challanges in dynamic load balancing

Applied Numerical Mathematics - Adaptive methods for partial differential equations and large-scale computation
Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids

IEEE Transactions on Parallel and Distributed Systems

Placing pipeline stages on a Grid: Single path and multipath pipeline execution

Future Generation Computer Systems
Load-balancing spatially located computations using rectangular partitions

Journal of Parallel and Distributed Computing
A survey of pipelined workflow scheduling: Models and algorithms

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable.