An optimal multicast algorithm for cube-connected cycles

This paper presents an efficient algorithm that implements one-to-many, or multicast, communication in one-port wormhole-routed cube-connected cycles (CCCs) in the absence of hardware multicast support. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented forn-dimensional CCCs that use deterministic routing of unicast messages. The algorithm can deliver a multicast message tom−1 destinations in [log2m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on CCCs with up to 10,240 nodes are also given.

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Hao-Yung Lo,et al.  A Routing Algorithm and Generalization for Cube-Connected Cycle Networks , 1997 .

[3]  C. Y. Roger Chen,et al.  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..

[4]  Jack Dongarra,et al.  ScaLAPACK: a scalable linear algebra library for distributed memory concurrent computers , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[5]  William J. Dally,et al.  The torus routing chip , 2005, Distributed Computing.

[6]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[7]  R. Libeskindg-Hadas.  A tight lower bound on the number of channels required for deadlock-free wormhole routing , 1998 .

[8]  Hong Zu,et al.  Optimal software multicast in wormhole-routed multistage networks , 1994, Proceedings of Supercomputing '94.

[9]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[10]  Sheng-De Wang,et al.  Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[11]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[12]  David Notkin,et al.  Computer science in Japanese universities , 1993, Computer.

[13]  Ralf Klasing.  Improved Compressions of Cube-Connected Cycles Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[14]  William J. Dally.  Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..

[15]  Nian-Feng Tzeng.  A Cube-Connected Cycles Architecture with High Reliability and Improved Performance , 1993, IEEE Trans. Computers.

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

[17]  Betty H. C. Cheng,et al.  Optimal Multicast Communication in Wormhole-Routed Torus Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[18]  Jehoshua Bruck,et al.  On the Construction of Fault-Tolerant Cube-Connected Cycles Networks , 1991, J. Parallel Distributed Comput..

[19]  Hong Xu,et al.  ComPaSS: efficient communication services for scalable architectures , 1992, Proceedings Supercomputing '92.

[20]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[21]  Robert A. van de Geijn,et al.  Reduction to condensed form for the eigenvalue problem on distributed memory architectures , 1992, Parallel Comput..