DMCA
Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers (1992)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 160 - 17 self |
BibTeX
@ARTICLE{Gupta92demonstrationof,
author = {Manish Gupta and Prithviraj Banerjee},
title = {Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers},
journal = {IEEE Transactions on Parallel and Distributed Systems},
year = {1992},
volume = {3},
pages = {179--193}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Most of the current projects leave this tedious problem almost entirely to the user. In this paper, we present a novel approach to the problem of automatic data partitioning. We introduce the notion of constraints on data distribution, and show how, based on performance considerations, a compiler identifies constraints to be imposed on the distribution of various data structures. These constraints are then combined by the compiler to obtain a complete and consistent picture of the data distribution scheme, one that offers good performance in terms of the overall execution time. We present results of a study we performed on Fortran programs taken from the Linpack and Eispack libraries and the Perfect Benchmarks to determine the applicability of our approach to real programs. The results a...
Keyphrases
automatic data partitioning technique good performance performance consideration overall execution time numerous research project data distribution scheme perfect benchmark tedious problem eispack library automatic data important problem suitable data partitioning scheme novel approach distributed memory machine various data structure consistent picture current project real program fortran program present result data distribution
