System architecture for the concurrent evaluation of applicative program expressions
The paper outlines the principles for the concurrent evaluation of applicative programs based on Berklings reduction language. The recursive style of program design supported by this language lends itself to a recursive partitioning scheme which, for suitable program expressions, generates dynamically a hierarchy of processes for the concurrent evaluation of subexpressions. This hierarchy can elegantly be mapped on to a system of cooperating reduction machines featuring a stack architecture. A special ticket mechanism enforces an upper limit on the number of processes that, at any time, may exist within the system, which does not significantly exceed the number of the available machines. 16 references.
- OSTI ID:
- 5342443
- Country of Publication:
- United States
- Language:
- English
Similar Records
An architectural model for a flat concurrent prolog processor
The design and implementation of Concurrent Smalltalk