Paper Info
Title
Resource management in dataflow
Abstract
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.
Year
DOI
Venue
1981
10.1145/800223.806765
FPCA
Field
DocType
ISBN
Resource management,Programming language,Program transformation,Nondeterministic algorithm,Functional programming,Computer science,Theoretical computer science,Dataflow,Machine code,Dataflow programming,Security token
Conference
0-89791-060-5
Citations 
PageRank 
References 
7
6.06
5
Authors
2
Name
Order
Citations
PageRank
Arthur J. Catto176.06
John R. Gurd232353.83