Analysis of program execution on a recursive stream-oriented data flow architecture
Conference
·
OSTI ID:5290505
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 of modelling and analysing 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 architectures. 11 references.
- OSTI ID:
- 5290505
- Report Number(s):
- CONF-830190-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analysis of program execution on a recursive stream-oriented data flow architecture
A data-driven parallel execution model and architecture for logic programs
Efficient Execution of Recursive Programs on Commodity Vector Hardware
Journal Article
·
Wed Jun 01 00:00:00 EDT 1983
· J. Syst. Soft.; (United States)
·
OSTI ID:5198603
A data-driven parallel execution model and architecture for logic programs
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6093559
Efficient Execution of Recursive Programs on Commodity Vector Hardware
Conference
·
Sat Jun 13 00:00:00 EDT 2015
·
OSTI ID:1194297