Performance of multi-rate data flow graphs for concurrent processing

Journal of Information Science and Engineering

Volumn 13, Issue 1, 1997, Pages 85-123

  Chao, Daniel Y ^a,b,c,d,e  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c LUCENT TECHNOLOGIES   (United States)

^d New Jersey Institute   (United States)

^e MIS Department of NCCU   (Taiwan)

Author keywords

Concurrent Processing; Critical loop; Data Flow Graph (DFG); Iteration bound; Multiple rate; Performance; Petri nets; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONCURRENT ENGINEERING; DATA STRUCTURES; GRAPHIC METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PERFORMANCE; PETRI NETS; POLYNOMIALS;

ACYCLIC PRECEDENCE GRAPH; CONCURRENT PROCESSING; CRITICAL LOOP; DATA FLOW GRAPHS; ITERATION BOUND; ITERATION PERIOD;

DATA PROCESSING;

EID: 0031096881     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (47)

1. W.B. Ackerman, "Data flow languages," IEEE Computer, Vol. 15, No. 2, 1982, pp. 15-25.
2. P.R. Gelabert and T.P. Barnwell, III, "Optimal automatic periodic multi-processor scheduler for fully specified flow graphs," IEEE Transactions on Signal Processing, Feb. 1993, pp. 858-888.
3. A. Bertoni and M. Torelli, "Probabilistic Petri nets and semi-markov systems." 2nd Euro. Workshop on Appl. & Theory of Petri Nets, Bad Honnef, Germany, 1981, pp. 59-78.
4. J. Vampos, G. Chiola, J.M. Colom and M. Silva., "Properties and performance bounds for timed marked graphs," IEEE Transactions On Circuits and System, Vol. 39, No. 5, 1992, pp. 386-401.
5. J. Campos, G. Chiola. J.M. Colom and M. Silva, "Tight polynomial bounds for steady state performance of marked graphs," International Proc. 3rd International Workshop PNPM 89, IEEE-CS Press, Kyoto, Japan, 1989, pp. 200-209.
6. J. Campos, G. Chiola and M. Silva, "Properties and steady-state performance bounds for petri nets with unique repetitive firing count vector," International Proc. 3rd International Workshop PNPM 89, IEEE-CS Press, Kyoto, Japan, 1989, pp. 210-220.
7. D.Y. Chao, (formerly Yaw, Y.) "Analysis and synthesis of distributed systems and protocols," Ph.D. Dissertation, Dept. of EECS, U.C. Berkeley, 1987.
8. D.Y. Chao, M.C. Zhou and D.T. Wang, "Extending knitting technique to petri net synthesis of automated manufacturing systems," The Computer Journal, Oxford University Press, Oxford, British, Vol. 37, No. 1-2, 1994, pp. 1-10.
9. D.Y. Chao and D.T. Wang, "A synthesis technique of General Petri nets," Journal. Systems Integration, Vol. 4, No. 1, 1994, pp. 67-102.
10. D.Y. Chao and D.T. Wang. "Iteration bunds of single-rate data flow graphs for concurrent processing," IEEE Trans. Circuits and Systems, Vol. 40, CAS-1, 1993, pp. 629-634.
11. D.Y. Chao and D.T. Wang, "X Window implementation of finding critical loop, next-critical loops and subcritical loops and iteration bounds for data flow graphs," MASCOTS'93, Simulation Series. Vol. 25, No. 1, Eds Schwetman, Walrand, H. J. Walrand, K. Bagchi, and D. Degrouts, SCS, San Diego, CA, Vol. 25, No. 1, 1993, pp. 107-112.
12. D.Y. Chao and D.T. Wang, "Theory, parallelization and scheduling of critical loop, subcritical loops, and next-critical Loops," Proc. Int'l Comp Symp, Taichung, Taiwan, 1992, pp. 285-292.
13. D.Y. Chao and D.T. Wang, "Minimum marking for no loop-combination of WMGs," MASCOTS'93, Simulation Series, Eds. Schwetman. H. J. Walrand, K. Bagchi, and D. Degrout, SCS, San Diego, California, Vol. 25, No. 1, 1993, pp. 265-270.
14. D.Y. Chao and D.T. Wang, "XPN-FMS: A modeling and simulation software for FMS using petri nets and X window," Int'l Journal Flexible Manufacturing Systems, Vol. 7, No. 4, 1995, pp. 339-360.
15. D.Y. Chao, "Application of final matrix to data flow graph scheduling using mutiprocessors," MIS Review. Vol. 5, 1995, pp. 65-80.
16. D.Y. Chao, M.C. Zhou and D.T. Wang, "Multiple-Weighted marked graphs," Proc. IFAC Congress 1993, Sydney, Australia, 1993, pp. 259-264.
17. L.F. Chao and E.H.M. Sha, "Retiming and unfolding data-flow graphs," Proc. of the 1992 International Conf. on Paralle Processing, Vol. 11, 1992, pp. 33-40.
18. J.C. Chung, "Optimal loop parallelization based on a retiming technique," Proc. of the 1992 International Conf. on Parallel processing, Vol. II, pp. 83-90.
19. A.L. Davis and R.M. Keller, "Data flow program graphs," IEEE Computer, Vol. 15, No. 2, 1982, pp. 26-41.
20. A. Fettweis, "Relaizability of digital filter networks," Arch. Elek. Ubertragung, 1976, pp. 90-96.
21. R.W. Floyd, "Algorithm 97: shortest path," Comm. ACM, Vol. 5, 1962, pp. 344-345.
22. G. Florin and S. natkin, "Evalutation based upon stochastic petir nets of the maximum throughput of a full duplex protocol," Informatik-Fachberichte, Vol. 52, 1982, pp. 280-288.
23. H. Forren and D.A. Schwartz. "Transforming periodic synchronous multiprocessor programs," Proc. ICASSP-87, Dallas, Texas, 1987, pp. 1406-1409.
24. S.Y. Kung, "On supercomputing with systolic/wavefront array processors," Proc. IEEE, Vol. 72, No. 7, 1984, pp. 867-884.
25. E.H. Landwebes and E.L. Robertson, "Properties of conflict-free and persistent petri nets," Journal of ACM, Vol. 25, NO. 3, 1978, pp. 352-364.
26. E.A. Lee and D.G. Messerschmitt. "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Transaction Computer., Vol. C-36, No. 1, 1987, pp. 24-35.
27. S.H. Lee and III, T.P. Barnwell, "Optimal multiprocessor implementation from a serial algorhtm specifications," Proc. ICASSP-88, New York, 1988, pp. 1694-1967.
28. C.E. Leiserson, F. Rose and J. Saxe, "Optimizing synchronous circuitry be retiming," Third Caltech conference on VLSI, Pasadena, CA, 1983, pp. 87-116.
29. Y.L. Lien, "Termination properties of generalized petri nets," SIAM Journal of Computers, Vol. 5, No. 2, 1976, pp. 251-265.
30. J. Magott, "Performance evaluation of system of systems of cyclic sequential processes with mutual exclusion using Petrinets," Information Processing Letters, Vol. 21, 1985, pp. 229-232.
31. J. Magott, "Performance evaluation of concurrent systems using conflictfree and persistent Petri nets," information Processing Letter, Vol. 26, 1987, pp. 77-80.
32. J. Magott, "Performance evaluation of communicating sequential processes (CSP) using Petri nets," IEE Proceedings-E, Vol. 139, No. 3, 1992, pp. 234-241.
33. M.K. Molloy, "Onthe integration of delay and throughput measures in distributed processing models," Ph.D. Thesis. Computer Science Dept., UCLA, 1981.
34. T. Murata, "Petri nets: properties, analysis and applications," IEEE Proc., Vol. 77, No. 4, 1989, pp. 541-580.
35. K.K. Parhi, "Algorithm transformation techniques for concurrent processors," IEEE Proc., 1989, pp. 1879-1895.
36. J.L. Peterson, "Petri net theory and the modeling of systems," Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981.
37. C.V. Ramamoorthy and G.S. Ho, "Performance evaluation of asynchronous concurrent systems using petri nets," IEEE Trans, on Software Engineering, Vol. SE-6, No. 5, 1980, pp. 440-449.
38. C. Ramchandani, "Analysis of asynchronous concurrent systems by timed petri nets," Ph.D. Thesis. MIT 1974 Project Mac report #MAC-TR-120.
39. R.R. Razouk, "The derivation of performance expressions for communication protocols from timed petri net modules," Tech. Rept. 211, University of Califormia, Irvine, 1983.
40. M. Renfors and Y. Neuvo, "The maximum sampling rate of digital filter under hardware speed constraints," IEEE Trans. Cric. Syst., Vol. CAS-28, No. 2, 1981, pp. 196-202.
41. D.A. Schwartz, "Synchronous multiprocessor realizations of shit invariant flow graphs," Ph.D. Dissertation, George Institute of Technology, Technical Report DSPL-85-2, 1985.
42. D.A. Schwartz and III, T.P. Barnwell, "A graphic theoretic technique for the generation of systolic implementations for shift invariant flow graphs," Proc. ICASS-84, San Diego, California, 1984.
43. J. Sifakis, "Petri nets for performance evaluation measuring," Modeling and Evaluating Computer System Proceedings of the Third International Symposium IFIP, Working Graph 7.3, Eds. H. Beilner and E. Glenbe, 1977, pp. 75-93.
44. M.Y. Souissi, "Une etude de la preservation de propetries par composition de reseaux depetri. Quelques extensions aux reseaua files. Application ala vaidation de protocols eo comunitation," Ph.D. Thesis, Universits Pierre et Maire Curie, 1990.
45. E. Teruel, P. Chrzastowski-Watchel, J.M. Colom and M. Silva, "On Weighted T-systems," Research Report GISI-RR-92-04. Dpto. Ing. Electrica e Informatia, Universidad de Zaragoza. January, 1992 and in K. Jensen, "Application and Theory of Petri Nets," Lecture Notes In Computer Science, Springer-Verlag, 1992, pp. 348-367.
46. E. Teruel, P. Chrzastowski-Watchel, J.M. Colom and M. Silva, "On Weighted T-systems," Research Report GISI-RR-92-04. Dpto. Ing. Electrica e Informatia, Universidad de Zaragoza. January, 1992 and in K. Jensen, "Application and Theory of Petri Nets," Lecture Notes In Computer Science, Springer-Verlag, 1992, pp. 348-367.
47. W.M. Zuberek, "Timed petri nets and preliminary performance evaluation," Proceedings of the 7th Annual Symposium on Computer Architecture, 1980, pp. 88-96.