This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
March 1993 (vol. 4 no. 3)
pp. 270-276

Even though exact algorithms exist for permutation routine of n/sup 2/ messages on an*n mesh of processors which require constant size queues, the constants are very largeand the algorithms very complicated to implement. A novel, simple heuristic for the above problem is presented. It uses constant and very small size queues (size=2). For all the simulations run on randomly generated data, the number of routing steps that is required by the algorithm is almost equal to the maximum distance a packet has to travel. A pathological case is demonstrated where the routing takes more than the optimal, and itis proved that the upper bound on the number of required steps is O(n/sup 2/).Furthermore, it is shown that the heuristic routes in optimal time inversion, transposition,and rotations, three special routing problems that appear very often in the design ofparallel algorithms.

[1] W. J. Dally and C. L. Seitz, "The torus routing chip,"Distributed Comput., vol. 1, pp. 187-196, 1986.
[2] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[3] D. Krizanc, S. Rajasekaran, and Th. Tsantilas, "Optimal routing algorithms for mesh-connected processor arrays," inVLSI Algorithms and Architectures (AWOC'88), J. Reif, Ed., Lecture Notes in Computer Science 319, 1988, pp. 411-422.
[4] M. Kunde, "Routing and sorting on mesh-connected arrays," inVLSI Algorithms and Architectures (AWOC'88), J. Reif, Ed., Lecture Notes in Computer Science 319, 1988, pp. 423-433.
[5] M. Kunde, "Packet routing on grids of processors," unpublished manuscript.
[6] T. Leighton, F. Makedon, and I. G. Tollis, "A 2n-2 step algorithm for routing in ann×narray with constant size queues," inProc. ACM Symp. Parallel Algorithms and Architectures, 1989, pp. 328-335.
[7] C. P. Schnorr and A. Shamir, "An optimal sorting algorithm for mesh connected computers," inProc. 18th ACM Symp. Theory Comput., May 1986.
[8] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263-271, 1972.
[9] L. G. Valiant, "A scheme for fast parallel communication,"SIAM J. Comput., vol. 11, pp. 350-361, 1982.

Index Terms:
Index Termsheuristic; permutation packet routing; meshes; low buffer requirements; exact algorithms;upper bound; optimal time inversion; transposition; parallel algorithms; packet switching;parallel algorithms; parallel architectures
Citation:
F. Makedon, A. Symvonis, "An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 3, pp. 270-276, March 1993, doi:10.1109/71.210810
Usage of this product signifies your acceptance of the Terms of Use.