A Formal Definition of Data Flow Graph Models
- 1 November 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (11) , 940-948
- https://doi.org/10.1109/tc.1986.1676696
Abstract
In this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bipartite graph with actors and links as the two vertex classes. Actors can be considered similar to transitions in Petri nets, and links similar to places. The nondeterministic nature of uninterpreted data flow graphs necessitates the derivation of liveness conditions.Keywords
This publication has 10 references indexed in Scilit:
- Analysis of Cray-1S architecturePublished by Association for Computing Machinery (ACM) ,1983
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982
- Data-Driven and Demand-Driven Computer ArchitectureACM Computing Surveys, 1982
- Data Flow LanguagesComputer, 1982
- Data Flow SupercomputersComputer, 1980
- Analytic Modeling of Computer SystemsComputer, 1978
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A preliminary architecture for a basic data-flow processorPublished by Association for Computing Machinery (ACM) ,1975
- A Comparison of Some Theoretical Models of Parallel ComputationIEEE Transactions on Computers, 1973
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966