Efficient Compilation of High-Level Data Parallel Algorithms (1994)
Cached
Download Links
- [www.cs.washington.edu]
- [ftp.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures |
| Citations: | 14 - 2 self |
BibTeX
@INPROCEEDINGS{Suciu94efficientcompilation,
author = {Dan Suciu and Val Tannen},
title = {Efficient Compilation of High-Level Data Parallel Algorithms},
booktitle = {In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures},
year = {1994},
pages = {57--66},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical "core" of an entire class of collection-oriented parallel languages. NSC is based on while-loops as opposed to general recursion. A formal, machine independent definition of the parallel time complexity and the work complexity of programs in NSC is given. Our main results are: (1) We give a translation method for a particular form of recursion, called map-recursion, into NSC, that preserves the time complexity and adds an arbitrarily small overhead to the work complexity, and (2) We give a compilation method for NSC into a very simple vector parallel machine, which preserves the time complexity and again adds an arbitrarily small overhead to the work complexity. 1 Introduction There are many advantages to programming in a high-level language. However, while sequential algorithms are most of the time designed and evaluated in reasonably high-level terms, the situation with parallel ...
