Studying the Structure of Parallel Algorithms as a Key Element of High-Performance Computing Education

  • Vladimir Voevodin
  • Alexander AntonovEmail author
  • Nina Popova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11339)


Since the computing world has become fully parallel, every software developer today should be familiar with the notion of “parallel algorithm structure.” If in recent years, students have studied a basic introduction to algorithms; today, parallel algorithm structure must become a vital part of computer science education. In this work we present two years of experience teaching a “Supercomputer Modeling and Technologies” course, and running practical assignments at the Computational Mathematics and Cybernetics faculty of Lomonosov Moscow State University, aimed at teaching students a methodology for analyzing parallel algorithm properties.


Structure of parallel algorithms High-performance computing education Parallel programming Educational curricula Computer science curricula Undergraduate students 



We are sincerely grateful to our colleagues form the Faculty of Computational Mathematics and Cybernetics and the Research Computing Center who helped us to deliver the lectures and organize the practical assignments—completing the educational program in this form without their help would simply have been impossible.


  1. 1.
    National Supercomputing Mission. Accessed 4 May 2018
  2. 2.
    Secretary of Energy Advisory Board. Report of the Task Force on Next Generation High Performance Computing, U.S. Department of Energy. August 18, 2014. Accessed 4 May 2018
  3. 3.
    Ezell, S.J., Atkinson, R.D.: The Vital Importance of High-Performance Computing to U.S. Competitiveness. Accessed 4 May 2018
  4. 4.
    SIAM Working Group on CSE Education. SIAM: Graduate Education for Computational Science and Engineering (2014). Accessed 4 May 2018
  5. 5.
    Chapman, B., et al.: DOE: assessment of workforce development needs in office of science research disciplines. Accessed 4 May 2018
  6. 6.
    Dongarra, J., et al.: Applied Mathematics Research for Exascale Computing, US - DOE Report, March 2014. Accessed 4 May 2018
  7. 7.
    Future Directions in CSE Education and Research. Report from a Workshop Sponsored by the Society for Industrial and Applied Mathematics (SIAM) and the European Exascale Software Initiative (EESI-2). Accessed 4 May 2018
  8. 8.
    Voevodin, V., Gergel, V., Popova, N.: Challenges of a systematic approach to parallel computing and supercomputing education. In: Hunold, S., et al. (eds.) Euro-Par 2015. LNCS, vol. 9523, pp. 90–101. Springer, Cham (2015). Scholar
  9. 9.
    Supercomputing Education in Russia. Final report on the national project “Supercomputing Education”, Supercomputing Consortium of the Russian Universities (2012). Accessed 4 May 2018
  10. 10.
    Voevodin, Vl.V., Gergel, V.P.: Supercomputing education: the third pillar of HPC. In: Computational Methods and Software Development: New Computational Technologies, vol. 11, no. 2, pp. 117–122. Moscow State University Press, Moscow (2010)Google Scholar
  11. 11.
    3rd European Workshop on Parallel and Distributed Computing Education for Undergraduate Students (Euro-EDUPAR). Accessed 4 May 2018
  12. 12.
    Prasad, S.K., Gupta, A., Rosenberg, A.L., Sussman, A., Weems Jr., C.C. (eds.): Topics in Parallel and Distributed Computing: Introducing Concurrency in Undergraduate Courses. Morgan Kaufmann, San Francisco (2015)Google Scholar
  13. 13.
    Computer Science Curricula 2013. education/cs2013_web_final.pdf. Accessed 4 May 2018
  14. 14.
    NSF/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing. Accessed 4 May 2018
  15. 15.
    Sadovnichy, V., Tikhonravov, A., Voevodin, Vl., and Opanasenko, V.: “Lomonosov”: supercomputing at Moscow State University. In: Contemporary High Performance Computing: From Petascale Toward Exascale, pp. 283–307. Chapman & Hall/CRC Computational Science), CRC Press, Boca Raton (2013)CrossRefGoogle Scholar
  16. 16.
    MSU Supercomputers: “Lomonosov-2”. Accessed 4 May 2018
  17. 17.
    Open Encyclopedia of Parallel Algorithmic Features. Accessed 4 May 2018
  18. 18.
    Antonov, A., Voevodin, V., Dongarra, J.: Algowiki: an open encyclopedia of parallel algorithmic features. J. Supercomput. Front. Innov. 2(1), 4–18 (2015)Google Scholar
  19. 19.
    Voevodin, V.: Mathematical Foundations of Parallel Computing. Series in Computer Science, vol. 33. World Scientific Publishing Co. (1992)Google Scholar
  20. 20.
    Voevodin, V., Voevodin, Vl.: Parallel Computing. BHV-Petersburg, St. Petersburg (2002)Google Scholar
  21. 21.
    Antonov, A., Teplov, A.: Generalized approach to scalability analysis of parallel applications. In: Carretero, J., et al. (eds.) ICA3PP 2016. LNCS, vol. 10049, pp. 291–304. Springer, Cham (2016). Scholar
  22. 22.
    Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Proceedings of 4th International Conference on Data Mining, Brighton, UK, pp. 442–446 (2004).
  23. 23.
    Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol. 3769, pp. 465–476. Springer, Heidelberg (2005). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Vladimir Voevodin
    • 1
  • Alexander Antonov
    • 1
    Email author
  • Nina Popova
    • 1
  1. 1.Lomonosov Moscow State UniversityMoscowRussia

Personalised recommendations