Costing Parallel Programs as a Function of Shapes (1998)
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{Jay98costingparallel,
author = {C. Barry Jay},
title = {Costing Parallel Programs as a Function of Shapes},
booktitle = {Science of Computer Programming},
year = {1998},
pages = {37--207}
}
OpenURL
Abstract
Efficient, portable 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 efficient portable parallel programs still remains to be solved. As different architectures can produce radically different levels of efficiency for a given algorithm, most research has focused on capturing hardware characteristics in a form that enables the compiler to choose an appropriate algorithm. For example, one may determine a suite of hardware parameters, as in BSP [Val90, McC94, HS98] or LogP [Ca93], that support a cost model for comparing alternative algorithms. While this work has been essential for our understand...







