An Approach to Composing Parallel Programs

Authors:
Lars-Erik Thorelli;Vladimir Vlassov
Affiliations:
-;-
Venue:
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Year:
2001

Citing 9
Cited 0

Linda in context

Communications of the ACM
Concurrent object-oriented programming

Communications of the ACM
Coordination languages and their significance

Communications of the ACM
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Flowgraphs and Flow Algebras

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
ERLANG for Concurrent Programming

ERLANG for Concurrent Programming
Synchronizing Communication Primitives for a Shared Memory Programming Model

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
A Synchronizing Shared Memory: Model and Programming Implementation

Proceedings of the 4th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

Principles for coordination and composition of parallel/distributed programs are discussed. We advocate a synchronizing shared memory model (EDA) for coordination and an algebraic approach to building programs using a linking language (LL) based on module composition, restriction and renaming. A prototype system ErlEda illustrating these principles is described. The system uses the concurrent programming language Erlang and its distributed environment as a basis. We illustrate the approach using the Dirichlet problem.