Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Generation of dataflow graphical object code for the Lapse programming language
CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
Indeterminacy, monitors, and dataflow
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
A data flow language for operating systems programming
Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
Structure handling in data-flow systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Asynchrony in parallel computing: from dataflow to multithreading
Progress in computer research
Asynchrony in parallel computing: from dataflow to multithreading
Progress in computer research
The Post-Game Analysis Framework-Developing Resource Management Strategies for Concurrent Systems
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Recent proposals for nondeterministic facilities in high-level dataflow programming systems have stopped short of giving details of low-level implementation. The underlying machine is assumed to provide basic nondeterministic operations which lead to the required high-level effects. This paper gives details of a practical implementation of one such high-level language, Id {3}, for a specific dataflow computer, the Manchester prototype {11}. It adds to previous work by the authors {7, 8} in which implementations of Communicating Processes {12} and Distributed Processes {5} were proposed. Id is based on an unravelling dataflow interpreter which closely resembles the labelled token scheme used in the Manchester prototype. Thus translation of Id programs into suitable machine code is relatively straightforward. However, instead of requiring complex nondeterministic operators to support resource managers as in {1}, the existing simple matching functions of the Manchester system {8} prove to be adequate. For the non-specialist reader, the Manchester labelled dataflow schema and the resource management constructs of Id are outlined before details of implementation are given.