Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Applied Parallel Computing

PARA 2004: Applied Parallel Computing. State of the Art in Scientific Computing pp 1071–1078Cite as

The Dragon Graph: A New Interconnection Network for High Speed Computing

  • Conference paper

  • 1408 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3732))

Abstract

A new interconnection network called the Dragon graph, is proposed. A Dragon graph is a variation of the hypercube and the cube-connected-cycle with constant degree four. The Dragon graph gains many advantages. It has a smaller diameter and cost than the comparable cube-connected-cycle. It is node-symmetric and edge-symmetric. A routing algorithm and a broadcasting algorithm are proposed in this paper.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  2. Chen, G., Lau, F.C.M.: Tighter layouts of the cube-connected cycles. IEEE Trans. Parallel and Distributed Systems 11, 182–191 (2000)

    Article  Google Scholar 

  3. Kuo, S.Y., Fuchs, W.K.: Reconfigurable cube-connected cycles architectures. Journal of Parallel and Distributed Computing 9, 1–10 (1990)

    Article  Google Scholar 

  4. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays,Trees, Hypercubes. Mogran Kaufmann, California (1992)

    MATH  Google Scholar 

  5. Lo, H.Y., Chen, J.D.: A routing algorithm and generalization for cube-connected cycles. IEICE Trans. Information Systems E80-D, 829–836 (1997)

    Google Scholar 

  6. Meliksetian, D.S., Chen, C.Y.R.: Optimal routing algorithm and the diameter of the cube-connected cycles. IEEE Trans. Parallel and Distributed Systems 4, 1172–1178 (1993)

    Article  Google Scholar 

  7. Preparata, F.P., Vuillemin, J.: The cube-connected cycles: A versatile network for parallel computations. Commun. ACM 25, 300–309 (1981)

    Article  MathSciNet  Google Scholar 

  8. Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Computers 37, 867–872 (1988)

    Article  Google Scholar 

  9. Sebastian, M.P., Rao, P.S.N., Jenkins, L.: Properties and performance of folded cubeconnected cycles. Journal of Systems Architecture 44, 359–374 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St.John’s and St.Mary’s Institute of Technology, Taipei, 251, Taiwan, R.O.C.

    Jywe-Fei Fang

Authors
  1. Jywe-Fei Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  2. Department of Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Kaj Madsen

  3. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, JF. (2006). The Dragon Graph: A New Interconnection Network for High Speed Computing. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_129

Download citation

  • DOI: https://doi.org/10.1007/11558958_129

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29067-4

  • Online ISBN: 978-3-540-33498-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation