Skip to main content
SpringerLink
Log in

The Star-Pyramid Graph: An Attractive Alternative to the Pyramid

  • Conference paper
Advances in Computer Systems Architecture (ACSAC 2005)

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

Included in the following conference series:

  • 1059 Accesses

Abstract

This paper introduces a new class of interconnection networks named Star-Pyramid, SP(n). A star-pyramid of dimension n is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1< i ≤ n, to a node in (i – 1)-star whose index is reached by removing the i symbol from the index of the former node in the i-star graph. Having extracted the properties of the new topology, featuring topological properties, a simple routing algorithm and Hamiltonicity then we compare the network properties of the proposed topology and the well-known pyramid topology. We show that the star-pyramid is more fault-tolerant and has less network diameter than its alternative, the pyramid. Finally, we propose a variant of star-pyramid, namely the generic star-pyramid as a topology with better scalability, fault-tolerance, and diameter.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to the n-cube. In: Proc. International Conference on Parallel Processing, St. Charles, Illinois, pp. 393–400 (1987)

    Google Scholar 

  2. Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection network. IEEE Trans. Comput. 38(4), 555–565 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M.: Algorithmic construction of Hamiltonians in pyramids. Information Processing letters 80, 75–79 (2000)

    Article  MathSciNet  Google Scholar 

  4. Cao, F., Hsu, D.F.: Faut-tolerance properties of pyramid networks. IEEE Trans. Comput. 48, 511–527 (1999)

    MathSciNet  Google Scholar 

  5. Sakia, D.K., Sen, R.K.: Two ranking schemes for efficient computation on the star interconnection network. IEEE Trans. Parallel and Dist. Systems 7(4), 321–327 (1996)

    Article  Google Scholar 

  6. Tseng, Y.C., Chang, S.H., Sheu, J.P.: Fault-tolerant ring embedding in a star graph with both link and node failure. IEEE Trans. Parallel and Dist. Systems 8(12), 1185–1195 (1997)

    Article  Google Scholar 

  7. Yeh, C.H., Parhami, B.: On the VLSI area and bisection width of star graphs and hierarchical cubic networks. In: Proc. of the 15th International Parallel & Distributed Processing Symposium, p. 72 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPM School of Computer Science and Sharif University of Technology, Tehran, Iran

    N. Imani & H. Sarbazi-Azad

Authors
  1. N. Imani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Sarbazi-Azad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Thambipillai Srikanthan

  2. National ICT, Australia

    Jingling Xue

  3. Centre for High Performance Embedded Systems, Nanyang Technological University, 639798, Singapore

    Chip-Hong Chang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imani, N., Sarbazi-Azad, H. (2005). The Star-Pyramid Graph: An Attractive Alternative to the Pyramid. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_41

Download citation

  • DOI: https://doi.org/10.1007/11572961_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29643-0

  • Online ISBN: 978-3-540-32108-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation