Advertisement

The twisted cube

  • Peter A. J. Hilbers
  • Marion R. J. Koopman
  • Jan L.A. van de Snepscheut
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)

Abstract

Properties that make the binary cube an attractive interconnection network for many-processor machines include expansibility, a simple routing-algorithm, and a diameter that grows logarithmically with the number of processors. In this paper we introduce an operation called twist that diverts two edges. By applying a twist to a number of judiciously chosen edges a cube is transformed into a so-called twisted cube. We show that the twisted cube has a diameter which is roughly half the diameter of the original cube, that a routing algorithm exists, albeit a more complex one, and that expansibility is retained.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [0]
    Edsger W. Dijkstra A Discipline of Programming Prentice Hall, Englewood Cliffs, NJ, 1976Google Scholar
  2. [1]
    W.D. Hillis The connection machine (computer architecture for the new wave) MIT AI Memo 646, Sept. 1981Google Scholar
  3. [2]
    C.L. Seitz Concurrent VLSI Architectures IEEE Transactions on Computers, Vol. C-33(1984)1247–1265Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Peter A. J. Hilbers
    • 1
  • Marion R. J. Koopman
    • 1
  • Jan L.A. van de Snepscheut
    • 1
  1. 1.Department of Mathematics and Computing ScienceGroningen UniversityThe Netherlands

Personalised recommendations