An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method

In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any processor. The paths for the packets are computed by a greedy heuristic method. Based on the multistage off-line method, we study the permutation packet routing problem on two-dimensional meshes. We ran millions of experiments based on random generated data and, for all of our experiments, we were able to compute a solution of length equal to the maximum distance a packet had to travel, and thus, match the actual lower bound for each routing pattern.

[1]  Fillia Makedon,et al.  An Eecient Heuristic for Permutation Packet Routing on Meshes with Low Buuer Requirements , 1993 .

[2]  Fillia Makedon,et al.  An E cient Heuristic for Permutation Packet Routing on Meshes with Low Bu er Requirements , 1993 .

[3]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[4]  Sanguthevar Rajasekaran,et al.  Optimal routing algorithms for mesh-connected processor arrays , 1988, Algorithmica.

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

[6]  Frank Thomson Leighton,et al.  Average case analysis of greedy routing algorithms on arrays , 1990, SPAA '90.

[7]  Journal of the Association for Computing Machinery , 1961, Nature.

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

[9]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  E. D. Dahl,et al.  Mapping and Compiled Communication on the Connection Machine System , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

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

[15]  Antonios Symvonis.  Optimal Algorithms for Packet Routing on Trees , 1994 .

[16]  Manfred Kunde.  Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

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

[18]  Antonios Symvonis.  Routing on Trees , 1996, Inf. Process. Lett..

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

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

[21]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[22]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[23]  Alon Itai,et al.  Two-Commodity Flow , 1978, JACM.

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

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

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

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