The Necessary Conditions for Clos-Type Nonblocking Multicast Networks

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/spl ges//spl Theta/(n[log r/log log r]). These results match the sufficient nonblocking condition for the currently best available explicitly constructed, constant stage nonblocking multicast network, and provide a basis for the optimal design of this type of multicast network.

[1]  Paul Feldman,et al.  Wide-Sense Nonblocking Networks , 1988, SIAM J. Discret. Math..

[2]  Yuanyuan Yang.  A Class of Interconnection Networks for Multicasting , 1998, IEEE Trans. Computers.

[3]  Frank K. Hwang,et al.  On Nonblocking Multiconnection Networks , 1986, IEEE Trans. Commun..

[4]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[5]  John F. Beetem,et al.  The GF11 supercomputer , 1985, ISCA '85.

[6]  Faustina Hwang,et al.  A Two-Stage Rearrangeable Broadcast Switching Network , 1985, IEEE Trans. Commun..

[7]  Yuanyuan Yang,et al.  Nonblocking Broadcast Switching Networks , 1991, IEEE Trans. Computers.

[8]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Thompson.  Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Transactions on Computers.

[10]  A. Yavuz Oruç,et al.  Design of efficient and easily routable generalized connectors , 1995, IEEE Trans. Commun..

[11]  Wataru Takahashi,et al.  Practical Implementation and Packaging Technologies for a Large-Scale ATM Switching System , 1991, IEEE J. Sel. Areas Commun..

[12]  V. E. Benes,et al.  Heuristic remarks and mathematical problems regarding the theory of connecting systems , 1962 .

[13]  Yuanyuan Yang,et al.  On blocking probability of multicast networks , 1998, IEEE Trans. Commun..

[14]  Gerald M. Masson,et al.  Generalized multi-stage connection networks , 1972, Networks.

[15]  Suresh Chalasani,et al.  Equivalence between SP2 high-performance switches and three-stage Clos networks , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[16]  Chin-Tau A. Lea,et al.  A new broadcast switching network , 1988, IEEE Trans. Commun..

[17]  Yuanyuan Yang,et al.  Fast Path Routing Techniques for Nonblocking Broadcast Networks , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[18]  Hong Xu,et al.  Unicast-Based Multicast Communication in Wormhole-Routed Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Yuanyuan Yang,et al.  Broadcast Ring Sandwich Networks , 1995, IEEE Trans. Computers.