• Publication
  • 1996
  • Issue No. 5 - May
  • Abstract - An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method
May 1996 (vol. 45 no. 5)
pp. 619-625

Abstract—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] F. Annexstein and M. Baumslag,"A Unified Approach to Off-Line Permutation Routing on Parallel Networks," Mathematical Systems Theory, vol. 24, pp. 233-251, 1991. pp. 398-406.
[2] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[3] E. Dahl,"Mapping and Compiled Communication on the Connection Machine," Proc. Fifth Distributed Memory Computing Conf., pp. 756-766,Charleston, S.C., Apr. 1990.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[5] A. Itai,"Two-Commodity Flow," J. ACM, vol. 25, no. 4, pp. 596-611, Oct. 1978.
[6] C. Kaklamanis,D. Krizanc, and S. Rao,"Simple Path Selection for Optimal Routing on Processor Arrays," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA'92, pp. 23-30,San Diego, June 1992.
[7] N. Karmarkar,"A New Polynomial-Time Algorithm for Linear Programming," Combinatorica, vol. 4, pp. 373-395, 1984.
[8] M. Kaufmann,J. Sibeyn, and T. Suel,"Derandomizing Algorithms for Routing and Sorting on Meshes," Proc. Fifth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 669-679,Arlington, Va., 1994.
[9] D. Krizanc,"A Note on Off-Line Routing on a Mesh-Connected Processor Array," Parallel Processing Letters, vol. 1, no. 1, pp. 67-70, 1991.
[10] D. Krizanc,S. Rajasekaran, and Th. Tsantilas,"Optimal Routing Algorithms for Mesh-Connected Processor Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 411-422, 1988.
[11] M. Kunde,"Routing and Sorting on Mesh-Connected Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 423-433, 1988.
[12] F.T. Leighton,"Average Case Analysis of Greedy Routing Algorithms on Arrays," Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA '90, Crete, July2-6, 1990.
[13] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[14] F.T. Leighton,B. Maggs, and S. Rao,"Universal Packet Routing Algorithms," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 256-269, 1988.
[15] F.T. Leighton,F. Makedon, and I.G. Tollis,"A 2n - 2 Algorithm for Routing in an n×n Array With Constant Size Queues," Proc. ACM Symp. Parallel Algorithms and Architectures, SPAA'89, pp. 328-335, June 1989.
[16] F. Makedon and A. Symvonis,"An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 4, pp. 270-276, Mar. 1993.
[17] S. Rajasekaran and R. Overholt,"Constant Queue Routing on a Mesh," J. Parallel and Distributed Computing, vol. 15, pp. 160-166, 1992.
[18] A.G. Ranade,"How to Emulate Shared Memory," Proc. 28th IEEE Symp. Foundation of Computer Science, pp. 185-194, 1987.
[19] A. Symvonis,"Routing on Trees," Information Processing Letters, vol. 57, pp. 215-223, 1996.
[20] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, May 1981.

Index Terms:
Mesh, multistage graph, off-line algorithm, packet routing, permutations.
Citation:
Antonios Symvonis, Jonathon Tidswell, "An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method," IEEE Transactions on Computers, vol. 45, no. 5, pp. 619-625, May 1996, doi:10.1109/12.509915
Usage of this product signifies your acceptance of the Terms of Use.