DMCA
I-Structures: Data Structures for Parallel Computing (1989)
Cached
Download Links
- [iss.cs.cornell.edu]
- [iss.ices.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 266 - 3 self |
BibTeX
@MISC{Arvind89i-structures:data,
author = {Arvind and Rishiyur S. Nikhil and et al.},
title = {I-Structures: Data Structures for Parallel Computing},
year = {1989}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
It is difficult to achieve elegance, efficiency and parallelism simultaneously in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three common functional data-structuring approaches--- lists using Cons and arrays using Update (both fine-grained operators), and arrays using make array (a "bulk" operator). We then present I-structures as an alternative, and show elegant, efficient and parallel solutions for the program examples in Id, a language with I-structures. The parallelism in Id is made precise by means of an operational semantics for Id as a parallel reduction system. I-structures make the language nonfunctional, but do not lose determinacy. Finally,weshowthateven in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.
Keyphrases
data structure parallel computing program example parallel solution common functional data-structuring approach list fine-grained operator operational semantics large data structure bulk operator functional data abstraction functional language functional program careful analysis parallel reduction system
