Multistage Off-Line Permutation Packet Routing on a Mesh: An Approach with Elementary Mathematics

Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.

[1]  Kevin Chiew,et al.  Scheduling and Routing of AMOs in an Intelligent Transport System , 2009, IEEE Transactions on Intelligent Transportation Systems.

[2]  Michael Kaufmann,et al.  Deterministic Permutation Routing on Meshes , 1997, J. Algorithms.

[3]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[4]  Fred S. Annexstein,et al.  A unified framework for off-line permutation routing in parallel networks , 1991, Mathematical systems theory.

[5]  P. Hall.  On Representatives of Subsets , 1935 .

[6]  Danny Krizanc.  A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array , 1991, Parallel Process. Lett..

[7]  Fillia Makedon,et al.  A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

[8]  Fred S. Annexstein,et al.  A unified approach to off-line permutation routing on parallel networks , 1990, SPAA '90.

[9]  Fillia Makedon,et al.  An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Fillia Makedon,et al.  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.

[11]  Danny Krizanc.  A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array , 1991, ICCI.

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Donald A. Calahan,et al.  Models of Access Delays in Multiprocessor Memories , 1992, IEEE Trans. Parallel Distributed Syst..

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[17]  Antonios Symvonis,et al.  An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method , 1996, IEEE Trans. Computers.

[18]  Michael Kaufmann,et al.  Derandomizing algorithms for routing and sorting on meshes , 1994, SODA '94.

[19]  Albert Y. Zomaya,et al.  An energy-efficient permutation routing protocol for single-hop radio networks , 2002, IEEE Transactions on Parallel and Distributed Systems.

[20]  Fei Tao. Qin.  Scheduling and routing of automated guided vehicles , 2003 .

[21]  Weifa Liang,et al.  Permutation Routing in All-Optical Product Networks , 1999, IPPS/SPDP Workshops.

[22]  Satish Rao,et al.  Simple path selection for optimal routing on processor arrays , 1992, SPAA '92.

[23]  Sanguthevar Rajasekaran,et al.  Constant Queue Routing on a Mesh , 1991, STACS.

[24]  Michael Kaufmann,et al.  Deterministic permutation routing on meshes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.