Efficient Collective Communications in Dual-Cube

The hypercube, or n-cube, has been widely used as the interconnection network in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. This paper introduces a new interconnection network, namely dual-cube, for large-scale parallel computers and describes the algorithms for efficient collective communications in dual-cube. The dual-cube network mitigates the problem of increasing number of links in the large-scale hypercube network while retains hypercube's topological properties. Design of efficient routing algorithms for collective communications is the key issue for any interconnection network. In this paper, we show that the collective communications can be done in dual-cube with almost the same communication times as in hypercube.

[1]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  Kanad Ghose,et al.  Hierarchical Cubic Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[3]  Philip K. McKinley,et al.  Collective Communication in Wormhole-Routed Massively Parallel Computers , 1995, Computer.

[4]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[5]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

[6]  Lionel M. Ni,et al.  Multicast in hypercube multiprocessors , 1988, Seventh Annual International Phoenix Conference on Computers an Communications. 1988 Conference Proceedings.

[7]  Joseph G. Peters,et al.  Circuit-Switched Broadcasting in Torus Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[8]  Trevor Mudge,et al.  Hypercube supercomputers , 1989, Proc. IEEE.

[9]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[10]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[11]  Shietung Peng,et al.  DUAL-CUBES: A NEW INTERCONNECTION NETWORK FOR HIGH-PERFORMANCE COMPUTER CLUSTERS , 2000 .

[12]  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).

[13]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[14]  Philip K. McKinley,et al.  Communication issues in parallel computing across ATM networks , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.

[15]  Sotirios G. Ziavras.  RH: A Versatile Family of Reduced Hypercube Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[16]  Shietung Peng,et al.  Fault-tolerant routing and disjoint paths in dual-cube: a new interconnection network , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

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

[18]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[19]  D. Lenoski,et al.  The SGI Origin: A ccnuma Highly Scalable Server , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.