Skip to main content
SpringerLink
Log in

Increasing communication bandwidth on hypercube

  • Parallel Processing And Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Included in the following conference series:

  • 120 Accesses

Abstract

We present an interconnection network, called Syncube, which is a new implementation scheme of hypercube. The hardware complexity of syncube is O(Nlog 2 N). Communication is much faster through syncube than that through a traditional hypercube with the same hardware complexity. We will give algorithm which can make full use of the connections and can realize log2 N permutations simultaneously so that communication bandwidth is fully increased.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Borodin and J. E. Hopcroft. Routing, merging and sorting on parallel models of computation. In Proc. of the 14th Annual Symposium on Theory of Computing, pages 338–344, May 1982.

    Google Scholar 

  2. M. T. Heath, editor. Hypercube Multiprocessors 1987. SIAM, Philadelphia, 1987.

    Google Scholar 

  3. W. D. Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.

    Google Scholar 

  4. K.Y. Lee. On the rearrangeability of 2(log2 N) — 1 stage permutation networks. IEEE Trans. on Computers, C-34(5):412–425, May 1985.

    Google Scholar 

  5. J. Lenfant. Parallel permutations of data: A Benes network control algorithm for frequently used permutations. IEEE Trans. on Computers, C-27(7):637–647, July 1978.

    Google Scholar 

  6. Z. Liu and J. You. Routing algorithms for hypercube. Technical Report 90-26, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1, 1990.

    Google Scholar 

  7. C. McCrosky. Message passing in synchronous hypercubes. Technical Report 86-4, Department of Computational Science, University of Saskatchewan, Saskatoon, Canada, 1986, (to appear in Computer System Science and Engineering).

    Google Scholar 

  8. C. Seitz. The Cosmic Cube. Communications of the ACM, 28(1):22–33, Jan. 1985.

    Article  Google Scholar 

  9. A. Waksman. A permutation network. Journal of the ACM, 15(1):159–163, Jan. 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, T6G 2H1, Edmonton, Alberta, Canada

    Zhiyong Liu & Jia-Huai You

Authors
  1. Zhiyong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia-Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Z., You, JH. (1991). Increasing communication bandwidth on hypercube. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_188

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_188

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation