A formal study of the Mcube interconnection network

  • Nitin K. Singhvi
  • Kanad Ghose
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 966)


The Mcube network has been proposed in [11] as a highly recursive and symmetrical interconnection network based on twisted links [1]. The Mcube topology has been developed and defined in terms of the structural constraints between components to enforce structural symmetry instead of specifying edges between node pairs. Mcubes have almost half the diameter of a comparable hypercube, a lower average internode distance than most other twisted networks and an uniform spatial node distribution. Unlike most twisted cube-based networks, randomly destined traffic results in uniform traffic flow through every node in the Mcube and links in the Mcube saturate more slowly than hypercubes. The Mcube is recursively partitionable and allows several parallel algorithms to execute as fast as or faster than on a hypercube. We establish the node distribution for the Mcubes to be uniform with the internode distance. Based on the constraints imposed by the construction and the routing algorithm, we derive an expression for the average internode distance for Mcubes. We also introduce an efficient broadcasting algorithm for the Mcube interconnection and show how Mcubes can be reconfigured into hypercubes. Finally, we show how representative parallel algorithms can be directly implemented on the Mcube topology.


interconnection Network hypercube massively parallel twisted cube 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Abraham and K. Padmanabhan, “An Analysis of the twisted Cube Topology,” Proc. 1989 International Conference on Parallel Processing, Vol. 1, pp.116–120.Google Scholar
  2. [2]
    N. Bhuyan and D. P. Agrawal, “Generalized Hypercube and Hyperbus structures for a Computer Network,” IEEE Trans. on computers, vol. C-33, No. 1, April 1984, pp. 323–333.Google Scholar
  3. [3]
    P. Cull and S. Larson, “The Mobius Cubes,” Proc. 6th Distributed Memory Computing Conference, April 1991, pp.699–702.Google Scholar
  4. [4]
    K. Efe, “The Crossed Cube,” IEEE Trans. on parallel and distributed systems. Vol. 3. No. 5, September 1992, pp. 513–524.Google Scholar
  5. [5]
    K. Ghose and K. R. Desai, “The Design and Evaluation of the Hierarchical Cubic Network,” Proc. 1990 International Conference on Parallel Processing, Vol. 1, pp. 355–362.Google Scholar
  6. [6]
    P. A. J. Hilbers, M. R. J. Koopman and J. L. A. van de Snepscheut. “The Twisted Cube,” Parallel Architectures and Languages Europe, June 1987, pp. 152–159.Google Scholar
  7. [7]
    K. Hwang and J. Ghosh, “Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers,” IEEE Trans. on Computers, Vol. C-36, No. 12, Dec 1987, pp. 1450–1466.Google Scholar
  8. [8]
    S. Lakshmivarahan and S. K. Dhall, “A New Hierarchy of Hypercube Interconnection Schemes for Parallel Computers,” Journal of Supercomputing, Vol. 2, 1988, pp. 81–108.Google Scholar
  9. [9]
    F. P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm. ACM, Vol. 24, No. 5, May 1981, pp. 300–309.Google Scholar
  10. [10]
    N. K. Singhvi and K. Ghose, “A Detailed Study of the Mcube Interconnection Topology,” Technical Report No.CS-TR-93-14, Dept. of Computer Science, SUNY Binghamton, 1993.Google Scholar
  11. [11]
    N. K. Singhvi and K. Ghose, “The Mcube: A Symmetrical Cube Based Network with Twisted Links,” Proc. 9th International Parallel Processing Symposium, 1995, pp. 11–16.Google Scholar
  12. [12]
    N. K. Singhvi, “The Connection Cubes: Symmetric, Low Diameter Networks with Low Node Degree,” Proc. 1993 International Parallel Processing Symposium, pp. 260–267.Google Scholar
  13. [13]
    L. D. Wittie, “Communication Structures for Large Networks of Microcomputers,” IEEE Trans on Computers, Vol. C-30, No. 4, April 81, pp. 264–273.Google Scholar
  14. [14]
    H. Sullivan and T. R. Bashkow, “A Large Scale, Homogeneous, Fully Distributed, Parallel Machine I,” Proc. Fourth International Symposium on Computer Architecture, March 1977, pp. 26–38.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Nitin K. Singhvi
    • 1
  • Kanad Ghose
    • 1
  1. 1.Department of Computer ScienceState University of New York at BinghamtonNY

Personalised recommendations