An analysis of program execution on a recursive stream-oriented data flow architecture

Authors:
Steven F. Jennings;Arthur E. Oldehoeft
Affiliations:
Colorado State University U.S.A.;Iowa State University U.S.A.
Venue:
Journal of Systems and Software
Year:
1983

Citing 4
Cited 0

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
The architecture and system method of DDM1: A recursively structured Data Driven Machine

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Aspects of Applicative Programming for Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The functional or applicative approach to the development of software leads to the natural exposure of parallelism. Data flow architectures are designed to exploit this parallelism. This paper describes a method for modeling and analyzing program execution on a stream-oriented, recursive data flow architecture. Based on a maximum path length technique, a recursive analysis of nodes (corresponding to high level constructs) results in an approximation of the time required to execute the program given adequate resources. By relating the structure of a program to the degree of exhibited parallelism, this method provides a useful tool for studying parallelism and evaluating certain problem classes to be run on similar architecutures.