Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers (1995)
| Venue: | in Proceedings of the 8th Workshop on Languages and Compilers for Parallel Computing |
| Citations: | 25 - 3 self |
BibTeX
@INPROCEEDINGS{Palermo95automaticselection,
author = {Daniel Palermo and Prithviraj Banerjee},
title = {Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers},
booktitle = {in Proceedings of the 8th Workshop on Languages and Compilers for Parallel Computing},
year = {1995},
pages = {392--406}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. For distributed-memory multicomputers such as the Intel Paragon, the IBM SP-1/SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performance. This task has traditionally been the user's responsibility, but in recent years much effort has been directed to automating the selection of data partitioning schemes. Several researchers have proposed systems that are able to produce data distributions that remain in effect for the entire execution of an application. For complex programs, however, such static data distributions may be insufficient to obtain acceptable performance. The selection of distributions that dynamically change over the course of a program's execution adds another dimension to the data partitioning problem. In this paper, we present a technique that can be used to automatically determine which partitionings are most beneficial over specific sections of a program while taking into a...
