Skip to main content
SpringerLink
Log in

Hybrid graph-based networks for multiprocessing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This article summarizes various ways of constructing large interconnection networks by performing different graph operations on smaller networks. The resultant hybrid graphs are classified, their inherent static topological properties are outlined and their relative advantages for multiprocessing applications are illustrated with several well-known networks. One class of hybrid graphs defined as compound networks, popularly known by an alternative name as hierarchical networks, is observed to be suitable for multicomputers in the current VLSI/WSI environment, as their use reduces network complexity, enhances scalability, reliability and fault-tolerance and supports locality of reference.

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

Access this article

Log in via an institution

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

  1. A. Agarwal, Limits in interconnection network performance, IEEE Transactions on Parallel and Distributed Systems 2 (1993) 398-412.

    Article  Google Scholar 

  2. D.P. Agrawal, Advanced Computer Architecture (Tutorial textbook) (IEEE Computer Soc. Press, Silver Spring, MD, 1986).

    Google Scholar 

  3. S.B. Akers and B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, in: Proc. of the 1986 International Conference on Parallel Processing (1986) pp. 216-223.

  4. B.W. Arden and H. Lee, A regular network for multicomputer systems, IEEE Transactions on Computers 30 (1982) 60-69.

    Google Scholar 

  5. D. Basak and D.K. Panda, Scalable Architectures with k-ary n-cube cluster-c organization, in: Proc. of the 5th IEEE Symposium on Parallel and Distributed Systems (1993) pp. 780-787.

  6. L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a network of microcomputers, IEEE Transactions on Computers 33 (1984) 323-333.

    Google Scholar 

  7. P.T. Breznay and M.A. Lopez, A class of ststic and dynamic hierarchical interconnection networks, in: Proc. of the 1994 International Conference on Parallel Processing, Vol. 1 (1994) pp. 59-62.

    Google Scholar 

  8. C. Chen, D.P. Agrawal and J.R. Burke, dBCube: A new class of hierarchical multiprocessor networks and its area efficient layout, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 1332-1343.

    Article  Google Scholar 

  9. C. Chen, D.P. Agrawal and J.R. Burke, Design and analysis of a class of highly scalable hierarchical networks: PdBCube, Journal of Parallel and Distributed Computing, Special Issue on Scalable Algorithms and Architectures, 22 (1994) 555-564.

    Article  Google Scholar 

  10. S.P. Dandamudi and D.L. Eager, On hierarchical hypercube multicomputer interconnection network design, Journal of Parallel and Distributed Computing 12 (1991) 283-289.

    Article  Google Scholar 

  11. S.K. Das and A.K. Banerjee, Hyper-Peterson network: Yet another hypercube topology, in: Proc. of Frontiers of Massively Parallel Computation (1992) pp. 270-277.

  12. K. Day and A.-E. Al-Ayyoub, The cross product of interconnection networks, IEEE Transactions Parallel Distributed Systems 18 (1997) 109-118.

    Article  Google Scholar 

  13. J. Duato, S. Yalmanchili and L. Ni, Interconnection Networks — An Engineering Approach (IEEE Computer Soc. Press, Silver Spring, MD, 1997).

    Google Scholar 

  14. R. Fernandes, D.K. Friesen and A. Kanevsky, Efficient routing in recursive interconnection networks, in: Proc. of the 1994 International Conference on Parallel Processing, Vol. 1 (1994) pp. 51-62.

    Google Scholar 

  15. R. Fernandes and A. Kanevsky, Generalized ring interconnection networks, in: Proc. of the 8th International Parallel Processing Symposium (1994) pp. 30-34.

  16. C.S. Ferner and K.Y. Lee, Hyperbanyan networks: A new class of networks for distributed-memory multiprocessors, in: Proc. of the 3rd Symposium on the Frontiers of Massively Parallel Computation (1992) pp. 254-261.

  17. E. Ganesan and D.K. Pradhan, The hyper-deBruijn networks: Scalable versatile architecture, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 962-978.

    Article  Google Scholar 

  18. K. Ghose and K.R. Desai, The design and evaluation of the hierarchical cubic network, in: Proc. of the 1990 International Conference on Parallel Processing, Vol. 1 (1990) pp. 355-362.

    Google Scholar 

  19. J.R. Goodman and C.H. Sequin, Hypertree: A multiprocessor interconnection topology, IEEE Transactions on Computers 30 (1981) 923-933.

    Google Scholar 

  20. W.-J. Hsu, Fibonacci cubes — A new interconnection topology, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 3-12.

    Article  Google Scholar 

  21. K. Hwang and J. Ghosh, Hypernet: A communication-efficient architecture for constructing massively parallel computers, IEEE Transactions on Computers 36 (1997) 1450-1466.

    Article  Google Scholar 

  22. O.H. Karam and D.P. Agrawal, Design and analysis of generalized link extended hierarchical interconnection networks, in: Proc. of the 7th International Parallel Processing Symposium (1993) pp. 643-649.

  23. J.M. Kumar and L.M. Patnaik, Extended hypercube: A hierarchical interconnection network of hypercubes, IEEE Transactions on Parallel and Distributed Systems 3 (1992) 45-57.

    Article  Google Scholar 

  24. Q.M. Malluhi and M.A. Bayoumi, The hierarchical hypercube: A new interconnection topology for massively parallel systems, IEEE Transactions on Parallel and Distributed Processing 5 (1994) 17-30.

    Article  Google Scholar 

  25. G. Memmi and Y. Raillard, Some new results about the (d, k)-graph problem, IEEE Transactions on Computers 31 (1982) 784-791.

    Google Scholar 

  26. S.R. Ohring and S.K. Das, The folded Peterson network: A new communication efficient multi-processor topology, in: Proc. of the 1993 International Conference on Parallel Processing, Vol. I, pp. 311-314.

  27. F. P. Preparata and J. Vuillemin, The cube-connected cycles: A versatile network parallel computation, Communications of the ACM 24 (1981) 300-309.

    Google Scholar 

  28. M.T. Raghunath and A. Ranade, Designing interconnection networks for multi-level packaging, in: Proc. of the 1993 Supercomputing, Portland (1993) pp. 772-781.

  29. A. Youssef and B. Narahari, The Banyan-hypercube networks, IEEE Transactions on Parallel and Distributed Systems 1 (1990) 160-169.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, 45221-0030, USA E-mail:

    Dharma P. Agrawal

  2. Computer Science and Engineering Department, Tatung Institute of Technology, 40 Chungshan North Road, 3rd Section, Taipei, Taiwan E-mail:

    Chienhua Chen

  3. J. Richard Burke, Inc., 3537 Pinnecle Drive, Cary, NC, 27511, USA E-mail:

    J. Richard Burke

Authors
  1. Dharma P. Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chienhua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Richard Burke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agrawal, D.P., Chen, C. & Burke, J.R. Hybrid graph-based networks for multiprocessing. Telecommunication Systems 10, 107–134 (1998). https://doi.org/10.1023/A:1019158831409

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019158831409

Keywords

Search

Navigation