A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Mapping a chain task to chained processors
Information Processing Letters
CHARM++: a portable concurrent object oriented system based on C++
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
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
Experimental evaluation of efficient sparse matrix distributions
ICS '96 Proceedings of the 10th international conference on Supercomputing
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids
The Journal of Supercomputing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
A unified algorithm for load-balancing adaptive scientific simulations
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Approximations for the general block distribution of a matrix
Theoretical Computer Science
Distributed processing of very large datasets with DataCutter
Parallel Computing - Clusters and computational grids for scientific computing
Efficient Partitioning of Sequences
IEEE Transactions on Computers
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Partitioning an Array onto a Mesh of Processors
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Locality Preserving Load Balancing with Provably Small Overhead
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Parallel Domain Decomposition and Load Balancing Using Space-Filling Curves
HIPC '97 Proceedings of the Fourth International Conference on High-Performance 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
Approximation algorithms for array partitioning problems
Journal of Algorithms
One-dimensional partitioning for heterogeneous systems: Theory and practice
Journal of Parallel and Distributed Computing
A repartitioning hypergraph model for dynamic load balancing
Journal of Parallel and Distributed Computing
Partitioning Spatially Located Computations Using Rectangles
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
A new approximation algorithm for multidimensional rectangle tiling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem, we investigate particular classes of solutions: rectilinear, jagged and hierarchical. We present a new class of solutions called m-way jagged partitions, propose new optimal algorithms for m-way jagged partitions and hierarchical partitions, propose new heuristic algorithms, and provide worst case performance analyses for some existing and new heuristics. Moreover, the algorithms are tested in simulation on a wide set of instances. Results show that two of the algorithms we introduce lead to a much better load balance than the state-of-the-art algorithms. We also show how to design a two-phase algorithm that reaches different time/quality tradeoffs.