DocumentCode
1152851
Title
A Formal Definition of Data Flow Graph Models
Author
Kavi, Krishna M. ; Buckles, Bill P. ; Bhat, U.Narayan
Author_Institution
Department of Computer Science Engineering, The University of Texas
Issue
11
fYear
1986
Firstpage
940
Lastpage
948
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
Bipartite graphs; Petri nets; data flow graphs; deadlocks; liveness; parallel computations; Algorithm design and analysis; Computational modeling; Computer languages; Concurrent computing; Data flow computing; Flow graphs; Parallel processing; Petri nets; Stochastic processes; System recovery; Bipartite graphs; Petri nets; data flow graphs; deadlocks; liveness; parallel computations;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1986.1676696
Filename
1676696
Link To Document