The Journal of Supercomputing

, Volume 28, Issue 1, pp 71–90 | Cite as

Efficient Collective Communications in Dual-Cube

  • Yamin Li
  • Shietung Peng
  • Wanming Chu

Abstract

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.

interconnection network hypercube collective communications broadcast and personalized communications algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. E. Amawy and S. Latifi. Properties and performance of folded hypercubes. IEEE Transactions on Parallel and Distributed Systems, 2:31–42, 1991.Google Scholar
  2. 2.
    J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach, IEEE Computer Society Press, 1997.Google Scholar
  3. 3.
    K. Efe. The crossed cube architecture for parallel computation. IEEE Transactions on Parallel and Distributed Systems, 3(5):513–524, 1992.Google Scholar
  4. 4.
    A. M. Farley. Minimum-time broadcast networks. Networks, 10:59–70, 1980.Google Scholar
  5. 5.
    K. Ghose and K. R. Desai. Hierarchical cubic networks. IEEE Transactions on Parallel and Distributed Systems, 6(4):427–435, 1995.Google Scholar
  6. 6.
    J. P. Hayes and T. N. Mudge. Hypercube supercomputers. Proceedings of IEEE, 17(12):1829–1841, 1989.Google Scholar
  7. 7.
    S. L. Johnson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers, 38(9):1249–1268, 1989.Google Scholar
  8. 8.
    P. Kermani and L. Kleinrock. Virtual cut-through: A new communication switching technique. Computer Networks, 13:267–286, 1979.Google Scholar
  9. 9.
    V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings Press, 1994.Google Scholar
  10. 10.
    Y. Lan, A. H. Esfahanian, and L. M. Ni. Multicast in hypercube multiprocessors. Journal of Parallel and Distributed Computing, 16(1):30–41, 1990.Google Scholar
  11. 11.
    J. Laudon and D. Lenoski. The SGI Origin2000: A ccNUMA highly scalable server. In Proceedings of the 24th Annual International Symposium on Computer Architecture, pp. 241–251, June 1997.Google Scholar
  12. 12.
    Y. Li and S. Peng. Fault-tolerant routing and disjoint paths in dual-cube. In Proceedings of the 8th International Conference on Parallel and Distributed Systems, pp. 315–322, June 2001.Google Scholar
  13. 13.
    P. K. McKinley, Y. J. Tsai, and D. Robinson. Collective communication in wormhole-routed massively parallel computers. IEEE Transactions on Parallel and Distributed Systems, 7(2):184–190, 1996.Google Scholar
  14. 14.
    L. Ni and P. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62–76, 1993.Google Scholar
  15. 15.
    J. G. Peters and M. Syska. Circuit-switched broadcasting in torus networks. IEEE Transactions on Parallel and Distributed Systems, 7(3):246–255, 1996.Google Scholar
  16. 16.
    F. P. Preparata and J. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. Commun. ACM, 24:300–309, 1981.Google Scholar
  17. 17.
    SGI, Origin2000 Rackmount Owner's Guide, 007-3456-003, http://techpubs.sgi.com/, 1997.Google Scholar
  18. 18.
    L. W. Tucker and G. G. Robertson. Architecture and applications of the Connection Machine. IEEE Computer, 21:26–38, 1988.Google Scholar
  19. 19.
    B. Vanvoorst, S. Seidel, and E. Barscz. Workload of an iPSC/860. In Proceedings of the Scalable High-Performance Computing Conference, pp. 221–228, 1994.Google Scholar
  20. 20.
    S. G. Ziavras. RH: A versatile family of reduced hypercube interconnection networks. IEEE Transactions on Parallel and Distributed Systems, 5(11):1210–1220, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Yamin Li
  • Shietung Peng
  • Wanming Chu

There are no affiliations available

Personalised recommendations