The twisted cube
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.
Unable to display preview. Download preview PDF.
- Edsger W. Dijkstra A Discipline of Programming Prentice Hall, Englewood Cliffs, NJ, 1976Google Scholar
- W.D. Hillis The connection machine (computer architecture for the new wave) MIT AI Memo 646, Sept. 1981Google Scholar
- C.L. Seitz Concurrent VLSI Architectures IEEE Transactions on Computers, Vol. C-33(1984)1247–1265Google Scholar