research-article

The Necessary Conditions for Clos-Type Nonblocking Multicast Networks

Authors:

Gerald M. MassonAuthors Info & Claims

IEEE Transactions on Computers, Volume 48, Issue 11

Pages 1214 - 1227

https://doi.org/10.1109/12.811110

Published: 01 November 1999 Publication History

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.

References

[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.

Digital Library

[8]

Y. Yang and G.M. Masson, “Nonblocking Broadcast Switching Networks,” IEEE Trans. Computers, vol. 40, pp. 1,005-1,015, 1991.

Digital Library

[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.

Digital Library

[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, pp. 1,128-1,137, 1988.

[15]

C. Lee and A.Y. Oruc, “Design of Efficient and Easily Routable Generalized Connectors,” IEEE Trans. Comm., vol. 43, 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.

Digital Library

[17]

X. Lin P.K. McKinley and L.M. Ni, “Deadlock-Free Multicast Wormhole Routing in 2D Mesh Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 793-804, Aug. 1994.

Digital Library

[18]

P.K. McKinley H. Xu A.-H. Esfahanian and L.M. Ni, “Unicast-Based Multicast Communication in Wormhole-Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1,252-1,265, Dec. 1994.

Digital Library

[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,” J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,280-1,288, 1991.

Digital Library

[22]

J. Beetem M. Denneau and D. Weingarten, “The GF11 Supercomputer,” Proc. 12th Ann. Int'l Symp. Computer Architecture, pp. 108-115, 1985.

Digital Library

[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, Mass.: Addison-Wesley, 1994.

Digital Library

[25]

M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company, 1979.

Digital Library

Cited By

Li ZGuo ZYang Y(2016)BCCCIEEE/ACM Transactions on Networking10.1109/TNET.2016.254743824:6(3740-3755)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1109/TNET.2016.2547438
Zhiyang Guo Yuanyuan Yang (2015)Exploring Server Redundancy in Nonblocking Multicast Data Center NetworksIEEE Transactions on Computers10.1109/TC.2014.234657664:7(1912-1926)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1109/TC.2014.2346576
Zhiyang Guo Yuanyuan Yang (2015)On Nonblocking Multicast Fat-Tree Data Center Networks with Server RedundancyIEEE Transactions on Computers10.1109/TC.2014.231563164:4(1058-1073)Online publication date: 9-Mar-2015
https://dl.acm.org/doi/10.1109/TC.2014.2315631
Show More Cited By

Index Terms

The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Interconnection architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Wide-Sense Nonblocking Clos Networks Under Packing Strategy

In this paper, we study wide-sense nonblocking conditions under packing strategy for the three-stage Clos network, or $v(m,n,r)$ network. Wide-sense nonblocking networks are generally believed to have lower network cost than strictly nonblocking ...
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IPPS '96: Proceedings of the 10th International Parallel Processing Symposium

Efficient interconnection networks are critical to the performance of large communication systems and parallel and distributed computing systems with hundreds or thousands of communication components. The well-known Clos network or v(m,n,r) network can ...
Nonblocking conditions of multicast three-stage interconnection networks

This article considers three-stage switching networks able to support multicast traffic, that is, connections in which one inlet is connected to more than one output at the same time. The nonblocking conditions for this network are studied under the ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 48, Issue 11

November 1999

144 pages

ISSN:0018-9340

Editor:
Jean-Luc Gaudiot
Univ. of Southern California, Los Angeles

Issue’s Table of Contents

Copyright © Copyright © 1999 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 November 1999

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li ZGuo ZYang Y(2016)BCCCIEEE/ACM Transactions on Networking10.1109/TNET.2016.254743824:6(3740-3755)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1109/TNET.2016.2547438
Zhiyang Guo Yuanyuan Yang (2015)Exploring Server Redundancy in Nonblocking Multicast Data Center NetworksIEEE Transactions on Computers10.1109/TC.2014.234657664:7(1912-1926)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1109/TC.2014.2346576
Zhiyang Guo Yuanyuan Yang (2015)On Nonblocking Multicast Fat-Tree Data Center Networks with Server RedundancyIEEE Transactions on Computers10.1109/TC.2014.231563164:4(1058-1073)Online publication date: 9-Mar-2015
https://dl.acm.org/doi/10.1109/TC.2014.2315631
Koksal C(2010)Rate quantization and the speedup required to achieve 100% throughput for multicast over crossbar switchesIEEE/ACM Transactions on Networking10.1109/TNET.2009.203858218:4(1207-1219)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1109/TNET.2009.2038582
Al Sukkar GAyoub J(2006)Performance of CLOS multicast networksProceedings of the 10th WSEAS international conference on Communications10.5555/1981726.1981809(419-424)Online publication date: 13-Jul-2006
https://dl.acm.org/doi/10.5555/1981726.1981809
Li JLi NAguilera MAspnes J(2005)Policy-hiding access control in open environmentProceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing10.1145/1073814.1073819(29-38)Online publication date: 17-Jul-2005
https://dl.acm.org/doi/10.1145/1073814.1073819
Yang YWang J(2003)Nonblocking k-Fold Multicast NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2003.117887714:2(131-141)Online publication date: 1-Feb-2003
https://dl.acm.org/doi/10.1109/TPDS.2003.1178877
Yang YWang J(2002)Nonblocking k-Fold Multicast NetworksProceedings of the 16th International Parallel and Distributed Processing Symposium10.5555/645610.661568Online publication date: 15-Apr-2002
https://dl.acm.org/doi/10.5555/645610.661568
Yang YWang JQiao C(2000)Nonblocking WDM Multicast Switching NetworksProceedings of the Proceedings of the 2000 International Conference on Parallel Processing10.5555/850941.852929Online publication date: 21-Aug-2000
https://dl.acm.org/doi/10.5555/850941.852929
Yang YWang JQiao C(2000)Nonblocking WDM Multicast Switching NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.89579311:12(1274-1287)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1109/71.895793

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents