Non-uniform 2-D grid partitioning for heterogeneous parallel architectures

Authors:
Phyllis Crandall;Michael J. Quinn
Affiliations:
-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 3

An efficient 3D grid based scheduling for heterogeneous systems

Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Adaptive data parallel computing on workstation clusters

Journal of Parallel and Distributed Computing
A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous applications in science and engineering have a problem space that can be represented as a 2-dimensional grid. While some of these problems exhibit uniform computational requirements over all regions of the grid, others are non-uniform: that is, some regions of the grid have more data points than others. We introduce a new block decomposition method, Fair Binary Recursive Decomposition (FBRD), which as suitable for a collection of heterogeneous processors, and extend it to accommodate non-uniform problems (NUFBRD). Mathematical comparisons of the NUFBRD method and other common partitioning schemes are presented to show the expected performance level of this new decomposition technique.