Automatic data layout for distributed-memory machines (1998)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 18 - 0 self |
BibTeX
@ARTICLE{Kennedy98automaticdata,
author = {Ken Kennedy and Ulrich Kremer},
title = {Automatic data layout for distributed-memory machines},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1998},
volume = {20},
pages = {20--4}
}
OpenURL
Abstract
The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet efficient machine-independent parallel programming model. After the algorithm selection, the data layout choice is the key intellectual challenge in writing an efficient program in such languages. The performance of a data layout depends on the target compilation system, the target machine, the problem size, and the number of available processors. This makes the choice of a good layout extremely difficult for most users of such languages. If languages such as HPF are to find general acceptance, the need for data layout selection support has to be addressed. We believe that the appropriate way to provide the needed support is through a tool that generates data layout specifications automatically. This article discusses the design and implementation of a data layout selection tool that generates HPF-style data layout specifications automatically. Because layout is done in a tool that is not embedded in the target compiler and hence will be run only a few times during the tuning phase of an application, it can use techniques such as integer programming that may be considered too computationally expensive for inclusion in production compilers. The proposed framework for automatic data layout selection builds and examines search spaces of candidate data layouts. A candidate layout is an efficient layout for







