This Article 
 Bibliographic References 
 Add to: 
Circuit-Switched Broadcasting in Torus Networks
March 1996 (vol. 7 no. 3)
pp. 246-255

Abstract—In this paper we present three broadcast algorithms and lower bounds on the three main components of the broadcast time for 2-dimensional torus networks (wrap-around meshes) that use synchronous circuit-switched routing. The first algorithm is based on a recursive tiling of a torus and is optimal in terms of both phases and intermediate switch settings when the start-up time to initiate message transmissions is the dominant cost. It is the first broadcast algorithm to match the lower bound of log5N on number of phases (where N is the number of nodes). The second and third algorithms are hybrids which combine circuit-switching with the pipelining and arc-disjoint spanning trees techniques that are commonly used to speed up store-and-forward routing. When the propagation time of messages through the network is significant, our hybrid algorithms achieve close to optimal performance in terms of phases, intermediate switch settings, and total transmission time. They are the first algorithms to achieve this performance in terms of all three parameters simultaneously.

[1] H.B. Bakoglu, Circuits, Interconnections, and Packaging for VLSI. Addison-Wesley, pp. 367-370, 1990.
[2] M. Barnett, D.G. Payne, and R. van de Geijn, "Optimal Broadcasting in Mesh-connected Architectures," Tech. Report, Univ. of Texas at Austin, 1988.
[3] J.-C. Bermond and P. Fraigniaud, "Communications in Interconnection Networks," Proc. Combinatorial Optimization in Science and Technology '91, 1991.
[4] S. Bokhari, "Communication Overhead on the Intel iPSC-860 hypercube," Tech. Report, ICASE, NASA Langley Research Center, 1990.
[5] R. Boppana and C. Raghavendra, "All-to-all Personalized Communication on Circuit-switched Hypercubes," Tech. Rep., Dept EE-Systems, USC, Los Angeles, 1990.
[6] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to High-Speed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330-339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[7] S. Borkar et al., "Supporting Systolic and Memory Communication in iWarp," Tech. Report TR CMU-CS-90-197, School of Computer Science, Carnegie-Mellon Univ., 1990.
[8] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[9] W.J. Dally and C.L. Seitz, "The Torus Routing Chip," J. Distributed Computing, vol. 1, no. 3, pp. 187-196, 1986.
[10] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[11] J. Dongarra, R. van de Geijn, and R. Whaley, "Two Dimensional Basic Linear Algebra Communication Subprograms," Proc. Sixth SIAM Conf. Parallel Processing, pp. 347-352, 1993.
[12] P. Fraigniaud, "Communications Intensives dans les ArchitecturesàMémoire Distribuée et Algorithmes Parallàles pour la Recherche de Racines de Polynômes," PhD thesis, Ecole Normale Supérieure de Lyon, Universitéde Lyon I, 1990.
[13] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79-133, 1994.
[14] B. Grünbaum and G.C. Shephard, Tilings and Patterns. W.H. Freeman, 1987.
[15] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1986.
[16] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[17] P. Kermani and L. Kleinrock, "Virtual Cut-through: a New Computer Communication Switching Technique," Computer Networks, vol. 3, pp. 267-286, 1979.
[18] X. Lin, P.K. McKinley, and L.M. Ni, "Performance Evaluation of Multicast Wormhole Routing in 2D-Mesh Multicomputers," Proc. 1991 Int'l Conf. Parallel Processing, pp. I-435-I-442, 1991.
[19] X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.
[20] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[21] B.B. Mandelbrot, The Fractal Geometry of Nature.San Francisco: W.H. Freeman, 1982.
[22] P. Michallon, D. Trystram, and G. Villard, "Optimal Broadcast Algorithms on the Torus," Tech. Report 872-I-01-92 LMC-IMAG, Grenoble, France, 1992.
[23] S. Nugent, "The iPSC/2 Direct-Connect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 51-60, Jan. 1998.
[24] W. Oed, "The CRAY Research Massively Parallel Processor System, CRAY T3D," Cray Research, Munich, 1993.
[25] J-Y.L. Park, S-K. Lee, and H-A. Choi, "New Algorithms for Broadcasting in Meshes," Tech. Report GWU-IIST-93-03, George Washington Univ., 1993.
[26] Y. Saad and M.H. Schultz, "Data Communication in Parallel Architectures," Parallel Computing, vol. 11, pp. 131-150, 1989.
[27] S.R. Seidel, "Broadcasting on Linear Arrays and Meshes," Tech. Report ORNL/TM-12356, Oak Ridge National Laboratory, 1993.
[28] C. Seitz,“Concurrent architectures,” VLSI and Parallel Computation, R. Suaya and G. Birtwislte, eds., ch. 1, pp. 1-84,San Mateo, Calif.: Morgan-Kaufman Publishers, Inc., 1990.
[29] M. Senechal, "Tiling the torus," Discr. and Comp. Geometry, vol. 3, pp. 55-72, 1988.
[30] T. Shimizu, T. Horie, and H. Ishihata, "Low-Latency Message Comm. Support for the AP1000," Proc. 19th Int'l. Symp. Computer Architecture, ACM, pp. 288-297, 1988.
[31] Q.F. Stout and B. Wagar,“Intensive hypercube communication: Prearranged communication inlink-bound machines,” J. Parallel and Distributed Computing, vol. 10, pp. 167-181, 1990.
[32] nCUBE 6400 Processor Manual, nCUBE Company, 1990.
[33] Paragon XP/S Product Overview, Intel Corporation, 1991.
[34] The T9000 Transputer Products Overview Manual, first edition, INMOS, 1991.

Index Terms:
Broadcasting, torus networks, circuit-switched routing, tilings, pipelining.
Joseph G. Peters, Michel Syska, "Circuit-Switched Broadcasting in Torus Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 246-255, March 1996, doi:10.1109/71.491578
Usage of this product signifies your acceptance of the Terms of Use.