Skip to main content

Advertisement

Springer Nature Link
Log in

A new hierarchy of hypercube interconnection schemes for parallel computers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper introduces a new hierarchy of cube-based interconnection schemes, called the base-b cube (which properly contains the well-known binary cube), for the design of parallel computers. This hierarchy admits a recursive definition and allows many more reconfigurations than are possible with the binary cube. Our analysis addresses the inherent cost-delay trade-off for this hierarchy along with a number of related topological properties such as sparsity, diameter, existence of node disjoint paths, and odd and even cycles. Embeddings of standard interconnection schemes including linear and two-dimensional arrays, rings, and complete binary trees in a base-b cube are illustrated.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barasch, L., Lakshmivarahan, S., and Dhall, S.K. 1987. Generalized Gray codes and their applications. Technical Report No. OU-PPI-TR-87–05 (July), Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, Okla.

    Google Scholar 

  • Beetem, J., Denneau, M., and Weingarten, D. 1985. The GF11 supercomputer. InConference Proceedings—The 12th Annual Symposium on Computer Architecture, IEEE Computer Society Press, pp. 108–115.

  • Bhatt, S.N., and Ipsen, I.C.F. 1985. How to embed trees in hypercubes. Research Report DCS-RR-443, Yale University, New Haven, Conn.

    Google Scholar 

  • Bhuyan, L.N., and Agrawal, D.P. 1984. Generalized hypercube and hyperbus structures for a computer network.IEEE Transactions on Computers, 33, 4 (Apr.), 323–333.

    Google Scholar 

  • Brandenberg, J.E., and Scott, D.S. 1985. Embeddings of communication trees and grids into hypercubes. Technical Report, Intel Scientific Computers, Beaverton, Ore.

    Google Scholar 

  • Browning, S.A. 1980. The tree machine: A highly concurrent computing environment. Technical Report, Computer Science TR-3760 (Jan.), California Institute of Technology, Pasadena, Calif..

    Google Scholar 

  • Chan, T.F., and Saad, Y. 1985. Multigrid algorithm on the hypercube multiprocessor. Research Report YALEU/DCS/RR-368 (Oct.), Yale University, New Haven, Conn.

    Google Scholar 

  • Dally, W., and Seitz, C. 1986. The torus routing chip. Report 5208: TR: 86, Department of Computer Science, California Institute of Technology, Pasadena, Calif.

    Google Scholar 

  • Feng, T. 1981. A survey of interconnection networks.Computer, 14, 1 (Jan.), 12–30.

    Google Scholar 

  • Gottlieb, A., Grishman, R., Kruskal, C.P., McAuliffe, K.P., Rudolph, L., and Snir, M. 1983. The NYU Ultracomputer—Designing an MIMD shared memory parallel computer.IEEE Transactions on Computers, 32, 2 (Feb.), 175–189.

    Google Scholar 

  • Hockney, R.W., and Jesshope, C.R. 1981.Parallel Computers. Adam and Hilger, Bristol, U.K.

    Google Scholar 

  • Hillis, W.D. 1986.The Connection Machine. The MIT Press, Boston.

    Google Scholar 

  • Johnsson, L. 1984. Odd-even cyclic reduction on ensemble architecture and the solution of tridiagonal systems of equations. Research Report YALEU/DCS/RR-339 (Oct.), Yale University, New Haven, Conn.

    Google Scholar 

  • Johnsson, S.L., and Ho, C.T. 1986. Spanning graphs for optimum broadcasting and personalized communication in hypercubes. Research Report DCS-500, Yale University, New Haven, Conn.

    Google Scholar 

  • Krumme, D.W., Venkataraman, K.N., and Cybenko, G. 1985. Hypercube embedding is NP-complete. InConference Proceedings—The first SIAM Conference on Hypercube Multiprocessors (Knoxville, Tenn., Aug. 26–27), pp. 148–161.

  • Lakshmivarahan, S., and Dhall, S.K. 1986. A lower bound on the communication complexity in solving linear tridiagonal systems on a cube architecture. InConference Proceedings—The Second SIAM Conference on Hypercube Multiprocessors (Oak Ridge National Lab., Sept. 29–Oct. 1).

  • Reingold, E.M., Nievergelt, J., and Deo, N. 1977.Combinatorial Algorithms: Theory and Practice. Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Saad, Y., and Schultz, M.H. 1985a. Data communications in hypercubes. Research Report DCS/RR-428 (Oct.), Yale University, New Haven, Conn.

    Google Scholar 

  • Saad, Y., and Schultz, M.H. 1985b. Topological properties of hypercubes. Research Report YALEU/ DCS/RR-389 (June), Yale University, New Haven, Conn.

    Google Scholar 

  • Satyanarayanan, M. 1980.Multiprocessors: A Comparative Study. Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Parallel Processing Institute, School of Electrical Engineering and Computer Science, University of Oklahoma, 73069, Norman, OK, USA

    S. Lakshmivarahan & Sudarshan K. Dhall

Authors
  1. S. Lakshmivarahan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Sudarshan K. Dhall
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lakshmivarahan, S., Dhall, S.K. A new hierarchy of hypercube interconnection schemes for parallel computers. J Supercomput 2, 81–108 (1988). https://doi.org/10.1007/BF00127849

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127849

Keywords