Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves (1995)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 51 - 2 self |
BibTeX
@ARTICLE{Pilkington95dynamicpartitioning,
author = {John R. Pilkington and Scott B. Baden},
title = {Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves},
journal = {IEEE Transactions on Parallel and Distributed Systems},
year = {1995},
volume = {7},
pages = {288--300}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We discuss Inverse Spacefilling Partitioning (ISP), a partitioning strategy for nonuniform scientific computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against Orthogonal Recursive Bisection (ORB) and a Median of Medians variant of ORB, ORB-MM. We present two results. First, ISP and ORB-MM are superior to ORB in rendering balanced workloads---because they are more finegrained ---and incur communication overheads that are comparable to ORB. Second, ISP is more attractive than ORB-MM from a software engineering standpoint because it avoids elaborate bookkeeping. Whereas ISP partitionings can be described succinctly as logically contiguous segments of the line, ORB-MM's partitionings are inherently unstructured. We describe the general d-dimensional ISP algorithm and report empirical results with two- and three-dimensional, non-hierarchical particle methods. Scott B. Bad...
