A system architecture for the concurrent evaluation of applicative program expressions

Authors:
Claudia Schmittgen;Werner Kluge
Affiliations:
-;-
Venue:
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Year:
1983

Citing 6
Cited 0

Data-Driven and Demand-Driven Computer Architecture

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
A preliminary architecture for a basic data-flow processor

ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
A multi-processor reduction machine for user-defined reduction languages.

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Computer architecture for correct programming

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 onto 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.