Parallel programming with coordination structures
Steven E. Lucco, Oliver J. Sharp · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1991
Parallel programs display two fundamentally different kinds of execution behavior: synchronous and asynchronous.Some methodologies, such as distributed data structures, are best suited to the construction of asynchronous programs.In this paper, we propose a methodology for synchronous parallel programming based on the notion of a coordination structure, a direct representation of the multidimensional dataflow patterns common to synchronous programs.We introduce Delirium, a language in which one can concisely express many useful coordination structures.
Cited by 16 works. doi:10.1145/99583.99612 Open-access PDF
Authors
References
- Numerical Recipes--The Art of Scientific Computing.
- Implementing remote procedure calls
- Can programming be liberated from the von Neumann style?
- Scans as primitive parallel operations
- Data parallel algorithms
- Report on the programming language Haskell
- An asynchronous programming language and computing machine
- Data Flow Languages
- SISAL: streams and iteration in a single assignment language. Language reference manual, Version 1. 2. Revision 1
- The VAL Language: Description and Analysis