This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
November 1999 (vol. 48 no. 11)
pp. 1214-1227

Abstract—Efficient interconnection networks are critical in providing low latency, high bandwidth communication in parallel and distributed computing systems with hundreds or thousands of processors. The well-known Clos network or $v(m,n,r)$ network can be extended to provide full one-to-many or multicast capability. In this paper, we consider several typical routing control strategies for Clos-type nonblocking multicast networks and derive the necessary conditions under which this type of network is nonblocking for arbitrary multicast assignments in the strict sense as well as under these control strategies. The necessary conditions obtained are represented as the number of middle stage switches $m \geq \Theta\left(n {\frac{\log r}{\log \log r}} \right )$. These results match the sufficient nonblocking condition for the currently best available explicitly constructed, constant stage nonblocking multicast network [8], [9], and provide a basis for the optimal design of this type of multicast network.

[1] L.M. Ni, “Should Scalable Parallel Computers Support Efficient Hardware Multicast?” Proc. 1995 ICPP Workshop Challenges for Parallel Processing, pp. 2-7, 1995.
[2] D.K. Panda, “Issues in Designing Efficient and Practical Algorithms for Collective Communication on Wormhole-Routed Systems,” Proc. 1995 ICPP Workshop Challenges for Parallel Processing, pp. 8-15, 1995.
[3] G.M. Masson and B.W. Jordan, “Generalized Multi-Stage Connection Networks,” Networks, vol. 2, pp. 191-209, 1972.
[4] G.W. Richards and F.K. Hwang, “A Two-Stage Rearrangeable Broadcast Switching Network,” IEEE Trans. Comm., vol. 33, pp. 1,025-1,034, 1985.
[5] F.K. Hwang and A. Jajszczyk, “On Nonblocking Multiconnection Networks,” IEEE Trans. Comm., vol. 34, pp. 1,038-1,041, 1986.
[6] M. Kumar, “Supporting Broadcast Connections in Benes Networks,” IBM Research Report RC-14063, 1988.
[7] P. Feldman, J. Friedman, and N. Pippenger, “Wide-Sense Nonblocking Networks,” SIAM J. Discrete Math., vol. 1, no. 2, pp. 158-173, May 1988.
[8] Y. Yang, G.M. Masson, “Nonblocking Broadcast Switching Networks,” IEEE Trans. Computers, vol. 40, pp. 1,005-1,015, 1991.
[9] Y. Yang and G.M. Masson, “Fast Path Routing Techniques for Nonblocking Broadcast Networks,” Proc. IEEE 13th Int'l Phoenix Conf. Computers and Comm., pp. 358-364, Apr. 1994.
[10] Y. Yang, “A Class of Interconnection Networks for Multicasting,” IEEE Trans. Computers, vol. 47, no. 8, pp. 899-906, Aug. 1998.
[11] Y. Yang and J. Wang, “On Blocking Probability of Multicast Networks,” IEEE Trans. Comm., vol. 46, no. 7, pp. 957-968, July 1998.
[12] J.P. Ofman, “A Universal Automation,” Trans. Moscow Math. Soc., vol. 14, 1965 (translation published by Am. Math. Soc., pp. 1,119-1,125, 1967 ).
[13] C.D. Thompson, “General Connection Networks for Parallel Processor Interconnection,” IEEE Trans. Computers, vol. 27, pp. 1,119-1,125, 1978.
[14] C.-T. Lea, “A New Broadcast Switching Network,” IEEE Trans. Comm., vol. 36, no. 10, pp. 1,128-1,137, 1988.
[15] C. Lee and A.Y. Oruç, “Design of Efficient and Easily Routable Generalized Connectors,” IEEE Trans. Comm., vol. 43, nos. 2,3, 4, pp. 646-650, 1995.
[16] Y. Yang and G.M. Masson, “Broadcast Ring Sandwich Networks,” IEEE Trans. Computers, vol. 44, no. 10, pp. 1,169-1,180, Oct. 1995.
[17] X. Lin, P.K. McKinley,, and L.M. Ni,"Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, Aug. 1994, pp. 793-804.
[18] P.K. McKinley et al., "Unicast-Based Multicast Communication in Wormhole-Routed Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, Dec. 1994, pp. 1252-1265.
[19] C. Clos, “A Study of Non-Blocking Switching Networks,” The Bell System Technical J., vol. 32, pp. 406-424, 1953.
[20] V.E. Benes, “Heuristic Remarks and Mathematical Problems Regarding the Theory of Switching Systems,” The Bell System Technical J., vol. 41, pp. 1,201-1,247, 1962.
[21] A. Itoh et al. “Practical Implementation and Packaging Technologies for a Large-Scale Atm Switching System,” IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,280-1,288. 1991.
[22] J. Beetem, M. Denneau, and D. Weingarten, “The GF11 Supercomputer,” Proc. 12th Ann. Int'l Symp. Computer Architecture, pp. 108-115, 1985.
[23] M.T. Bruggencate and S. Chalasani, “Equivalence between SP2 High-Performance Switches and Three-Stage Clos Networks,” Proc. 25th Int'l Conf. Parallel Processing, pp. I-1-I-8, 1996.
[24] R. L. Graham, D. E. Knuth, and O. Patashnik,Concrete Mathematics. Reading, MA: Addison-Wesley, 1989.
[25] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.

Index Terms:
Interconnection networks, multicast networks, routing control strategies, nonblocking, necessary conditions.
Citation:
Yuanyuan Yang, Gerald M. Masson, "The Necessary Conditions for Clos-Type Nonblocking Multicast Networks," IEEE Transactions on Computers, vol. 48, no. 11, pp. 1214-1227, Nov. 1999, doi:10.1109/12.811110
Usage of this product signifies your acceptance of the Terms of Use.