Skip to main content

Parallel Generation and Analysis of Optimal Chordal Ring Networks Using Python Tools on Kunpeng Processors

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2023)

Abstract

Parallel versions of the reduced exhaustive search algorithm based on the Python tools are implemented to optimize chordal ring networks, which are of practical interest in the design of systems on a chip and supercomputer systems. An analysis of the effectiveness of parallel programs with different numbers of MPI processes on Kunpeng processors was carried out. The speed-up of several parallel computing schemes was experimentally evaluated and analyzed. The large dataset of all optimal chordal networks with numbers of up \(6 \cdot 10^4\) nodes was generated for the first time. A preliminary analysis of experimentally obtained dataset has been carried out and the existence of new families of optimal chordal ring networks with analytical descriptions of parameters has been discovered.

Supported by state assignment of ICMMG SB RAS N 0251-2022-0005.

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

References

  1. Arden, B.W., Lee, H.: Analysis of chordal ring network. IEEE Trans. Comput. C-30(4), 291–295 (1981)

    Google Scholar 

  2. Morillo, P., Comellas, F., Fiol, M.A.: The optimization of Chordal Ring Networks. Commun. Technol., Eds. Q. Yasheng and W. Xiuying. World Scientific, 295–299 (1987)

    Google Scholar 

  3. Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput. 24, 2–10 (1995)

    Article  Google Scholar 

  4. Hwang, F.K.: A survey on multi-loop networks. Theoret. Comput. Sci. 299, 107–121 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Monakhova, E.A.: A survey on undirected circulant graphs. Discr. Math. Algorithms Appl. 4(1), 1250002 (2012)

    Google Scholar 

  6. Pedersen, J.M., Riaz, T.M., Madsen, O.B.: Distances in generalized double rings and degree three chordal rings. In: IASTED International Conference on Parallel and Distributed Computing and Networks (IASTED PDCN2005), pp. 153–158. Austria (2005)

    Google Scholar 

  7. Parhami, B.: Periodically regular chordal rings are preferable to double-ring networks. J. Interconnection Netw. 9(1), 99–126 (2008)

    Article  Google Scholar 

  8. Farah, R.N., Chien, S.L.E., Othman, M.: Optimum free-table routing in the optimised degree six 3-modified chordal ring network. J. Commun. 12(12), 677–682 (2017)

    Article  Google Scholar 

  9. Chen, S.K., Hwang, F.K., Liu, Y.C.: Some combinatorial properties of mixed chordal rings. J. Interconnection Netw. 4(1), 3–16 (2003)

    Article  Google Scholar 

  10. Gutierrez, J., Riaz, T., Pedersen, J., Labeaga, S., Madsen, O.: Degree 3 networks topological routing. Image Process. Commun. 14(4), 35–48 (2009)

    Google Scholar 

  11. Ahmad, M., Zahid, Z., Zavaid, M., Bonyah, E.: Studies of chordal ring networks via double metric dimensions. Math. Probl. Eng., Article ID 8303242 (2022). https://doi.org/10.1155/2022.d303242

  12. Monakhova, E.A., Monakhov, O.G., Romanov, A.Y.: Routing algorithms in optimal degree four circulant networks based on relative addressing: comparative analysis for networks-on-chip. IEEE Trans. Netw. Sci. Eng. 10(1), 413–425 (2023)

    Article  MathSciNet  Google Scholar 

  13. Monakhov, O., Monakhova, E., Romanov, A., Sukhov, A., Lezhnev, E.: Adaptive shortest path search algorithm in optimal two-dimensional circulant networks: implementation for networks-on-chip. IEEE Access 8, 215010–215019 (2021)

    Article  Google Scholar 

  14. Huang, X., Ramos, A.F., Deng, Y.: Optimal circulant graphs as low-latency network topologies. J. Supercomput. 78, 13491–13510 (2022). https://doi.org/10.1007/s11227-022-04396-5

    Article  Google Scholar 

  15. Platt, E.: Network Science with Python and NetworkX Quick: Start Guide. Packt, Birmingham, UK (2019)

    Google Scholar 

  16. igraph - The network analysis package. https://igraph.org/. Accessed 14 May 2023

  17. Zaccone, G.: Python Parallel Programming Cookbook. Packt, Birmingham, UK (2015)

    Google Scholar 

  18. Dalcin, L., Paz, R., Storti, M., D’Elia, J.: MPI for Python: performance improvements and MPI-2 extensions. J. Parallel Distrib. Comput. 68(5), 655–662 (2008). https://doi.org/10.1016/j.jpdc.2007.09.005

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oleg Monakhov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Monakhov, O., Monakhova, E., Kireev, S. (2023). Parallel Generation and Analysis of Optimal Chordal Ring Networks Using Python Tools on Kunpeng Processors. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2023. Lecture Notes in Computer Science, vol 14098. Springer, Cham. https://doi.org/10.1007/978-3-031-41673-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-41673-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-41672-9

  • Online ISBN: 978-3-031-41673-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics