Skip to main content

Efficiency Estimation for the Mathematical Physics Algorithms for Distributed Memory Computers

  • Conference paper
  • First Online:

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

Abstract

The paper presents several models of parallel program runs on computer platforms with distributed memory. The prediction of the parallel algorithm efficiency is based on algorithm arithmetic and communication complexities. For some mathematical physics algorithms for explicit schemes of the solution of the heat transfer equation the speedup estimations were obtained, as well as numerical experiments were performed to compare the actual and theoretically predicted speedups.

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   39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Learn about institutional subscriptions

References

  1. AlgoWiki: Open encyclopedia of algorithm properties. http://algowiki-project.org. Accessed 15 Apr 2018

  2. Voevodin, V.V., Voevodin, Vl.V.: Parallel Computing. BHV-Petersburg, St. Petersburg (2002, in Russian)

    Google Scholar 

  3. Gergel, V.P., Strongin, R.G.: Fundamentals of Parallel Computing for Multiprocessor Computer Systems. Publishing House of the Nizhny Novgorod State Univ., Nizhny Novgorod (2003, in Russian)

    Google Scholar 

  4. Konshin, I.N.: Parallel computational models to estimate an actual speedup of analyzed algorithm. In: Proceedings of the International Conference on Russian Supercomputing Days, 26–27 September 2016, Moscow, Russia, pp. 269–280. Moscow State University, Moscow (2016, in Russian) http://2016.russianscdays.org/files/pdf16/269.pdf

  5. Konshin, I.: Parallel computational models to estimate an actual speedup of analyzed algorithm. In: Voevodin, V., Sobolev, S. (eds.) RuSCDays 2016. CCIS, vol. 687, pp. 304–317. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-55669-7_24

    Chapter  Google Scholar 

  6. Konshin, I.N.: Parallelism in computational mathematics. International Summer Supercomputer Academy. Track: Parallel Algorithms of Algebra and Analysis and Experiments of Supercomputer Modeling. MSU, Moscow (2012, in Russian). http://academy2012.hpc-russia.ru/files/lectures/algebra/0704_1_ik.pdf. Accessed 15 Apr 2018

  7. INM RAS cluster (2018, in Russian). http://cluster2.inm.ras.ru. Accessed 15 Apr 2018

  8. MPI: The Message Passing Interface standard. http://www.mcs.anl.gov/research/projects/mpi/. Accessed 15 Apr 2018

  9. Bajdin, G.V.: On some stereotypes of parallel programming. Vopr. Atomn. Nauki Tekhn., Ser. Mat. Model Fiz. Prots., no. 1, pp. 67–75 (2008, in Russian)

    Google Scholar 

Download references

Acknowledgements

The theoretical part of this work has been supported by the Russian Science Foundation through the grant 14-11-00190. The experimental part was partially supported by RFBR grant 17-01-00886.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Igor Konshin .

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

Konshin, I. (2019). Efficiency Estimation for the Mathematical Physics Algorithms for Distributed Memory Computers. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2018. Communications in Computer and Information Science, vol 965. Springer, Cham. https://doi.org/10.1007/978-3-030-05807-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05807-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05806-7

  • Online ISBN: 978-3-030-05807-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics