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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
6. References
Edsger W. Dijkstra A Discipline of Programming Prentice Hall, Englewood Cliffs, NJ, 1976
W.D. Hillis The connection machine (computer architecture for the new wave) MIT AI Memo 646, Sept. 1981
C.L. Seitz Concurrent VLSI Architectures IEEE Transactions on Computers, Vol. C-33(1984)1247–1265
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hilbers, P.A.J., Koopman, M.R.J., van de Snepscheut, J.L. (1987). The twisted cube. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_126
Download citation
DOI: https://doi.org/10.1007/3-540-17943-7_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17943-6
Online ISBN: 978-3-540-47144-8
eBook Packages: Springer Book Archive