This Article 
 Bibliographic References 
 Add to: 
Homogeneous Routing for Homogeneous Traffic Patterns on Meshes
August 2000 (vol. 11 no. 8)
pp. 781-793

Abstract—The performance analysis of dynamic routing algorithms in interconnection networks of parallel computers has thus far predominantly been done by simulation studies. A limitation of simulation studies is that they usually only hold for specific combinations of network, routing algorithm, and traffic pattern. In this paper, we derive saturation point results for the class of homogeneous traffic patterns and a large class of routing functions on meshes. We show that the best possible saturation point on a mesh is half the best possible saturation point on a torus. We also show that, if we restrict ourselves to homogeneous routing functions, the worst possible saturation point on a mesh is again half the best possible saturation point. Finally, we present a class of homogeneous routing functions, containing the well-known e-cube routing function, which are all optimal for all homogeneous traffic patterns.

[1] K. Bolding and L. Snyder, “Mesh and Torus Chaotic Routing,” Proc. Advanced Research in VLSI and Parallel Systems Conference, pp. 333–347, Mar. 1992.
[2] K. Bolding and W. Yost, "Design of a Router for Fault-Tolerant Networks," Proc. 1994 Parallel Computer Routing and Comm. Workshop, pp. 226-240, May 1994.
[3] R. Boppana and S. Chalasani, "A Comparison of Adaptive Wormhole Routing Algorithms," Proc. 20th Ann. Int'l Symp. Computer Architecture," pp. 351-360, 1993.
[4] Y.M. Boura and C.R. Das, “A Class of Partially Adaptive Routing Algorithms for n_Dimensional Meshes,” Int'l Conf. Parallel Processing, vol. 3, pp. 175–182, 1993.
[5] W. Chou, A.W. Bragg, and A.A. Nilsson, "The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment," IEEE Trans. Commun., vol. COM-29, no. 4, pp. 481-490, Apr 1981.
[6] J. Duato, "Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Evaluation of a New Algorithm," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 840-847, 1991.
[7] J. Duato and P. López, "Performance Evaluation of Adaptive Routing Algorithms for k-ary n-cubes," Proc. Workshop Parallel Computer Routing and Communication, May. 1994.
[8] S. Felperin, L. Gravano, G. Pifarre, and J. Sanz, "Fully-adaptive routing: Packet switching performance and wormhole algorithms," Proc. Supercomputing '91, pp. 654-663, 1991.
[9] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[10] C.J. Glass and L.M. Ni, “Adaptive Routing in Mesh-Connected Networks,” Proc. 1992 Int'l Conf. on Distributed Computing Systems, pp. 12-19, May 1992.
[11] C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 1992.
[12] J.Y. Ngai and C.L. Seitz, "A Framework For Adaptive Routing in Multicomputer Networks," Proc. ACM Symp. Parallel Algorithms Architectures, 1989.
[13] T. Nguyen and L. Snyder, "Performance of Minimal Adaptive Routers," Proc. Parallel Computer Routing and Communication Workshop, May 1994.
[14] G.D. Pifarré, L. Gravano, S.A. Felperin, and J.L.C. Sanz, "Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes and Other Networks: Algorithms and Simulations," IEEE Trans. Parallel Distributed Systems, vol. 5, no. 3, pp. 247-263, Mar. 1994.
[15] G.D. Pifarré, L. Gravano, G. Denicolay, and J.L.C. Sanz, “Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network,” Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1,121–1,139, Nov. 1994.
[16] S.D. Young and S. Yalamanchili, “Adaptive Routing in Generalized Hypercube Architectures,” Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 564–571, 1991.
[17] M. Mitzenmacher, “Bounds on the Greedy Routing Algorithm for Array Networks,” J. Computer and Systems Sciences, vol. 53, pp. 317–327, 1996.
[18] G.D. Stamoulis and J.N. Tsitsiklis, “The Efficiency of Greedy Routing in Hypercubes and Butterflies,” Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 248–259, 1991.
[19] L.D. Aronson, “A Theory of Routing Functions from Concept to Analysis,” doctoral thesis, Delft University of Tech nology, 1999.
[20] L.D. Aronson, “Saturation Point Analysis for Nonadaptive Routing Algorithms,” Technical Report 96-143, Faculty of Math. and Informatics, Delft Univ. of Tech nology, 1996. 1996htm.

Index Terms:
Routing, mesh, torus, homogeneous, automorpshism, parallel communication, parallel computer, performance analysis, saturation, traffic pattern.
L.d. Aronson, "Homogeneous Routing for Homogeneous Traffic Patterns on Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 781-793, Aug. 2000, doi:10.1109/71.877937
Usage of this product signifies your acceptance of the Terms of Use.