Skip to main content

Extended Routing Table Generation Algorithm for the Angara Interconnect

  • Conference paper
  • First Online:

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

Abstract

In this paper we describe the extended routing rules in the low-latency high-bandwidth Angara interconnect with torus topology. The Angara interconnect supports 4D torus topology with routing based on the direction order routing (DOR) implemented using direction bits and additional first and last steps. To avoid deadlocks in a ring bubble flow control is used. Implementation of the First and Last Steps method allows to violate the DOR rule. We propose an algorithm for generation and analysis of routing tables that guarantees no deadlocks in the Angara interconnect. The proposed algorithm increases the number of different routable systems and improves fault tolerance.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Adiga, N.R., et al.: Blue Gene/L torus interconnection network. IBM J. Res. Dev. 49(2.3), 265–276 (2005)

    Article  Google Scholar 

  2. Agarkov, A., Ismagilov, T., Makagon, D., Semenov, A., Simonov, A.: Performance evaluation of the Angara interconnect. In: Proceedings of the International Conference on Russian Supercomputing Days, Moscow, Russia, pp. 626–639 (2016)

    Google Scholar 

  3. Bulut, E., Geyik, S.C., Szymanski, B.K.: Conditional shortest path routing in delay tolerant networks. In: International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM), pp. 1–6. IEEE (2010)

    Google Scholar 

  4. Chiu, G.M.: The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Sys. 11(7), 729–738 (2000)

    Article  Google Scholar 

  5. Dally, W.J., Seitz, C.L.: The torus routing chip. Distrib. Comput. 1(4), 187–196 (1986)

    Article  Google Scholar 

  6. Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessor interconnection networks (1988)

    Google Scholar 

  7. Domke, J., Hoefler, T., Matsuoka, S.: Routing on the dependency graph: a new approach to deadlock-free high-performance routing. In: Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, pp. 3–14. ACM (2016)

    Google Scholar 

  8. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27–34. ACM (2003)

    Google Scholar 

  9. Glass, C.J., Ni, L.M.: The turn model for adaptive routing. ACM SIGARCH Comput. Archit. News 20(2), 278–287 (1992)

    Article  Google Scholar 

  10. Khalilov, M., Timofeev, A.: Optimization of MPI-process mapping for clusters with Angara interconnect. Lobachevskii J. Math. 39(9), 1188–1198 (2018)

    Article  MathSciNet  Google Scholar 

  11. Kim, J.H., Liu, Z., Chien, A.A.: Compressionless routing: a framework for adaptive and fault-tolerant routing. In: ACM SIGARCH Computer Architecture News, vol. 22, pp. 289–300. IEEE Computer Society Press (1994)

    Google Scholar 

  12. Mohapatra, P.: Wormhole routing techniques for directly connected multicomputer systems. ACM Comput. Surv. (CSUR) 30(3), 374–410 (1998)

    Article  Google Scholar 

  13. Mukosey, A.V., Semenov, A.S.: An approximate algorithm for choosing the optimal subset of nodes in the Angara interconnect with failures. Vychislitel’nye Metody i Programmirovanie 18(1), 53–64 (2017)

    Google Scholar 

  14. Ostroumova, G., Orekhov, N., Stegailov, V.: Reactive molecular-dynamics study of onion-like carbon nanoparticle formation. Diam. Relat. Mater. 94, 14–20 (2019)

    Article  Google Scholar 

  15. Palesi, M., Holsmark, R., Kumar, S., Catania, V.: Application specific routing algorithms for networks on chip. IEEE Trans. Parallel Distrib. Sys. 20(3), 316–330 (2008)

    Article  Google Scholar 

  16. Polyakov, S., Podryga, V., Puzyrkov, D.: High performance computing in multiscale problems of gas dynamics. Lobachevskii J. Math. 39(9), 1239–1250 (2018)

    Article  MathSciNet  Google Scholar 

  17. Puente, V., Beivide, R., Gregorio, J.A., Prellezo, J., Duato, J., Izu, C.: Adaptive bubble router: a design to improve performance in torus networks. In: Proceedings of the 1999 International Conference on Parallel Processing, pp. 58–67. IEEE (1999)

    Google Scholar 

  18. Scott, S.L., et al.: The Cray T3E network: adaptive routing in a high performance 3D torus (1996)

    Google Scholar 

  19. Simonov, A., Makagon, D., Zhabin, I., Shcherbak, A., Syromyatnikov, E., Polyakov, D.: Pervoye pokoleniye vysokoskorostnoy kommunikatsionnoy seti \(\ll \)Angara\(\gg \) (the first generation of Angara high-speed interconnect). Naukoyemkiye tekhnologii (Sci. Technol.) 15(1), 21–28 (2014)

    Google Scholar 

  20. Skeie, T., Lysne, O., Theiss, I.: Layered shortest path (lash) routing in irregular system area networks. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, pp. 194–201. IEEE Computer Society, Washington, DC (2002). http://dl.acm.org/citation.cfm?id=645610.661560

  21. Stegailov, V., et al.: Angara interconnect makes GPU-based Desmos supercomputer an efficient tool for molecular dynamics calculations. Int. J. High Perform. Comput. Appl. 33, 507–521 (2019)

    Article  Google Scholar 

  22. Stegailov, V., Smirnov, G., Vecher, V.: VASP hits the memory wall: processors efficiency comparison. Concurrency Comput. Pract. Exp. 31, e5136 (2019). https://doi.org/10.1002/cpe.5136

    Article  Google Scholar 

  23. Tolstykh, M., Goyman, G., Fadeev, R., Shashkin, V.: Structure and algorithms of SLAV atmosphere model parallel program complex. Lobachevskii J. Math. 39(4), 587–595 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Semenov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mukosey, A., Simonov, A., Semenov, A. (2019). Extended Routing Table Generation Algorithm for the Angara Interconnect. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2019. Communications in Computer and Information Science, vol 1129. Springer, Cham. https://doi.org/10.1007/978-3-030-36592-9_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36592-9_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36591-2

  • Online ISBN: 978-3-030-36592-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics