Rectilinear partitioning of irregular data parallel computations. Contractor report
Technical Report
·
OSTI ID:6098235
This paper describes new mapping algorithms for domain-oriented data parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns. The authors consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network and a relatively slower global network; these partitions heuristically attempt to maximize the fraction of communication carried by the local network. This paper provides an improved algorithm for finding the optimal partition in one dimension, new algorithms for partitioning in two dimensions, and shows that optimal partitioning in three dimensions is NP-complete. They discuss their application of these algorithms to real problems.
- Research Organization:
- National Aeronautics and Space Administration, Hampton, VA (United States). Inst. for Computer Applications in Science and Engineering
- OSTI ID:
- 6098235
- Report Number(s):
- AD-A-240681/7/XAB; ICASE--91-55; CNN: NAS1-18605
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multistage linear-array assignment problem. Final report
Mapping algorithms onto parallel architectures
Genetic algorithms for graph partitioning and incremental graph partitioning
Technical Report
·
Mon Oct 31 23:00:00 EST 1988
·
OSTI ID:6062950
Mapping algorithms onto parallel architectures
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6093069
Genetic algorithms for graph partitioning and incremental graph partitioning
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87649