Modeling and simulating data flow computations at machine language level

Authors:
Stone H. Yu;Tadao Murata
Affiliations:
Department of Information Engineering, University of Illinois, Chicago, Illinois;Department of Information Engineering, University of Illinois, Chicago, Illinois
Venue:
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Year:
1979

Citing 7
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples

ACM Computing Surveys (CSUR)
Petri Nets

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
First version of a data flow procedure language

Programming Symposium, Proceedings Colloque sur la Programmation
The formulation and application of evaluation nets

The formulation and application of evaluation nets
Structured programming

Structured programming

A Data Flow Computer Architecture with Program and Token Memories

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the data flow organization of computers and programs, which exhibits a good deal of inherent concurrencies in a computation by imposing no superfluous precedence constraints. In view of the popularity of parallel and distributed processing, this organization can be expected to play an increasingly prominent role in the design and development of computer systems. A schematic diagram called DF-graphs, suitable for modeling data flow computations at the machine language level, is introduced. To facilitate the storage of DF-graphs in computers, matrix equations which fully describe their structure and their dynamic behaviors are developed as an alternate representation. Also demonstrated is the feasibility of simulating the execution of computations specified by DF-graphs on a network of conventional mini- and microprocessors.