Costing Parallel Programs as a Function of Shapes (1999)
Cached
Download Links
- [linus.socs.uts.edu.au]
- [linus.socs.uts.edu.au]
- DBLP
Other Repositories/Bibliography
| Venue: | Science of Computer Programming |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Jay99costingparallel,
author = {C. Barry Jay},
title = {Costing Parallel Programs as a Function of Shapes},
booktitle = {Science of Computer Programming},
year = {1999},
pages = {37--207}
}
OpenURL
Abstract
Portable, efficient, parallel programming requires cost models to compare different possible implementations. In turn, these require knowledge of the shapes of the data structures being used, as well as knowledge of the hardware parameters. This paper shows how shape analysis techniques developed in the FISh programming language could be exploited to produce a data parallel language with an accurate, portable cost model. 1 Introduction The problem of constructing portable efficient parallel programs is still unsolved. It originates in the observation that an algorithm that executes efficiently in one setting may be extremely inefficient in another. Hence, the challenge is to automatically adapt the algorithm to match the circumstances. To do this during compilation requires a cost model that is able to identify which of two alternative algorithms is faster. To date, most work has focussed on measuring the impact of changes to hardware as observed through a small suite of hardwar...







