Performance analysis of program execution on data flow systems

A Petri Net model and graph analysis technique is presented for program execution on data flow systems. The model encompasses static systems in which recurrent computations reuse the same copy of a program node and dynamic systems in which reuse of a node results in the creation of a new copy. Program execution time, assuming sufficient resources, is analysed by use of the theory of state machine decomposable petri nets and an approximation technique based on graph reduction. Numerical simulation results are presented for validation of the model for static systems. 14 references.