Distributed memory compiler design for sparse problems (1995)
Download From
IEEE
Download Links
- [ntrs.nasa.gov]
- [ftp.cs.umd.edu]
- [bmi.osu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Computers |
| Citations: | 66 - 10 self |
BibTeX
@ARTICLE{Wu95distributedmemory,
author = {Janet Wu and Raja Das and Joel Saltz and Harry Berryman and Seema Hiranandani},
title = {Distributed memory compiler design for sparse problems},
journal = {IEEE Transactions on Computers},
year = {1995},
volume = {44}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper addresses the issue of compiling concurrent loop nests in the presence of complicated array references and irregularly distributed arrays. Arrays accessed within loops may contain accesses that make it impossible to precisely determine the reference pattern at compile time. This paper proposes a run time support mechanism that is used e ectively by a compiler to generate e cient code in these situations. The compiler accepts as input aFortran 77 program enhanced with speci cations for distributing data, and outputs a message passing program that runs on the nodes of a distributed memory machine. The runtime support for the compiler consists of a library of primitives designed to support irregular patterns of distributed array accesses and irregularly distributed array partitions. Avariety of performance results on the Intel iPSC/860 are presented.
