Mapping iterative algorithms onto processor arrays by the use of Petri Net models

In this paper, Petri Nets (PNs) are used for deriving efficient mapping transformations of a wide class of algorithms to processor arrays. In the proposed methodology, given an algorithm and the interconnections of the processor array, two PNs are constructed: one that is related to the algorithm and one that is related to the processor array. The former PN models the execution of the algorithm and differs drastically from the common data-flow methods. Based on properties of PNs and on the reachability tree analysis technique, a theorem is given, through which the two PN model suggest all possible ways of implementing the algorithm by the processor array.<<ETX>>

[1]  Kimon P. Valavanis.  On the hierarchical modeling analysis and simulation of flexible manufacturing systems with extended Petri nets , 1990, IEEE Trans. Syst. Man Cybern..

[2]  Patrice Quinton,et al.  The systematic design of systolic arrays , 1987 .

[3]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[4]  E. F. Deprettere,et al.  From recursive algorithm to parallel VLSI accelerator: a hierarchical design system with testbed , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[5]  Riccardo Scattolini,et al.  Petri nets based approach to software development for real-time control , 1991 .

[6]  Toshimasa Watanabe,et al.  The minimum initial submarking problem of Petri nets with application to communication protocol design , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[7]  Chris J. Scheiman,et al.  A Processor-Time-Minimal Systolic Array for Transitive Closure , 1992, IEEE Trans. Parallel Distributed Syst..

[8]  MuDer Jeng,et al.  A review of synthesis techniques for Petri nets with applications to automated manufacturing systems , 1993, IEEE Trans. Syst. Man Cybern..

[9]  C. Reutenauer.  The Mathematics of Petri Nets , 1990 .

[10]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[11]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[12]  Peter R. Cappello,et al.  A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms , 1992, IEEE Trans. Parallel Distributed Syst..

[13]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[14]  J. Bu,et al.  Systematic design of regular VLSI processor arrays , 1990 .

[15]  M.B.E. Abdelrazik.  Graph-based model for implementing sequential circuits , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[16]  Sadiq M. Sait,et al.  High level synthesis of controllers for communication protocols , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[17]  Jean-Michel Berge.  VHDL Designer's Reference , 1992 .

[18]  Dan I. Moldovan,et al.  Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[19]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[20]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.