Skip to main content

One-to-One Embedding between Hyper Petersen and Petersen-Torus Networks

  • Conference paper
Grid and Distributed Computing (GDC 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 63))

Included in the following conference series:

Abstract

Once a designed network is embedded into a newly designed network, a developed algorithm in the designed network is reusable in a newly designed network. Petersen-Torus has been designed recently, and Hyper Petersen has already been designed as a well-known interconnection network. In this study, it was proven that Hyper Petersen network whose degree increases with the increased number of nodes can be embedded into a Petersen-Torus network having fixed degree. Hyper Petersen log2 n 2 + 3 was embedded into Petersen-Torus PT(n,n) with expansion 1, dilation 1.5n+2, and congestion 5n. The embedding algorithm was designed for expansion 1, and congestion and dilation are in proportion to O(n) owing to the aspect of Hyper Petersen that the degree increases.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bettayeb, S., Cong, B., Girou, M., Sudborough, I.H.: Embedding Star Networks into Hypercubes. IEEE trans. comput. 45(2), 186–194 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Stricker, T.M.: Supporting the hypercube programming model on mesh architectures. In: Proc. of the fourth annual ACM symposium on Parallel algorithms and architectures, pp. 148–157 (1992)

    Google Scholar 

  3. Gonzalez, A., Garcia, V., Cerio, L.D.: Excuting Algorithm with Hypercube Topology on Torus Multicomputers. IEEE Transactions on Parallel and Distributed Systems 6(8), 803–814 (1995)

    Article  Google Scholar 

  4. Matic, S.: Emulation of Hypercube Architecture on Nearest-Neighbor Mesh-Connected Prcessing Elements. IEEE Transaction on computer 39, 698–700 (1990)

    Article  Google Scholar 

  5. Seo, J.H., Lee, H.O., Jang, M.S.: Petersen-Torus Networks for Multicomputer Systems. In: Proc. int’l Conf. of NCM 2008, September 2008, vol. 1, pp. 567–571 (2008)

    Google Scholar 

  6. Das, S.K., Banerjee, A.K.: Hyper Petersen network: Yet another hypercube-like topology. In: Proc. of the 4th Symp., on the Frontiers of Massively Parallel Computation, McLean, Virginia, USA, October 1992, pp. 270–277 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seo, JH., Jang, MS., Kim, E., Ban, KJ., Ryu, N., Lee, H. (2009). One-to-One Embedding between Hyper Petersen and Petersen-Torus Networks. In: Ślęzak, D., Kim, Th., Yau, S.S., Gervasi, O., Kang, BH. (eds) Grid and Distributed Computing. GDC 2009. Communications in Computer and Information Science, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10549-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10549-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10548-7

  • Online ISBN: 978-3-642-10549-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics