Coordination languages for parallel programming
β Scribed by F. Arbab; P. Ciancarini; C. Hankin
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 159 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
A number of interesting models have been proposed and used to support coordination languages and systems. In this introductory paper, we first present a number of important concepts that form a context for classification and comparison of various coordination models and languages, and their applications. Next, we review three models and their associated languages, representing three different approaches to coordination. We illustrate the application of each model and language by using it to solve the classical dining philosophers problem. This paper ends with an overview of the rest of the papers that appear in this special issue.
π SIMILAR VOLUMES
This paper surveys the different levels of language available to program microcomputers and stresses the trend towards higher levels languages, such as PASCAL, with their variety of data structures and structured control facilities. Comparison is made between the language requirements for microcompu
We present Spar, a programming language for semi-automatic parallel programming, in particular for the programming of array-based applications. The language has been designed as part of the Automap project, in which a compiler and runtime system are being developed for distributed-memory systems. As
A data structure called ~trips is described for representing linked lists, which enables unit time access of random list elements. Running parallel prefix on strips effectively converts a list into an array. When combined with nondeterministic statement sequencing and data operations, loops for perf