Abstract
The paper presents two models of parallel program runs on platforms with shared and distributed memory. By means of these models, we can estimate the speedup when running on a particular computer system. To estimate the speedup of OpenMP program the first model applies the Amdahl’s law. The second model uses properties of the analyzed algorithm, such as algorithm arithmetic and communication complexities. To estimate speedup the computer arithmetic performance and data transfer rate are used. For some algorithms, such as the preconditioned conjugate gradient method, 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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Voevodin, V.V.: Parallel Computing. BHV-Petersburg, St. Petersburg (2002). (in Russian)
Bogachev, K.Y.: Parallel Programming. Binom, Moscow (2003). (in Russian)
Gergel, V.P., Strongin, R.G.: Parallel Computing for Multiprocessor Computers. NGU Publ., Nizhnij Novgorod (2003). (in Russian)
AlgoWiki: open encyclopedia of algorithm properties. http://algowiki-project.org. Accessed 15 June 2016
Amdahl, G.M.: Validity of the single-processor approach to achieving large scale computing capabilities. In: AFIPS Conference Proceedings, Atlantic City, NJ, 18–20 April, vol. 30, pp. 483–485. AFIPS Press, Reston (1967). http://www-inst.eecs.berkeley.edu/n252/paper/Amdahl.pdf. Accessed 15 June 2016
Antonov, A.: Under the Amdahl’s law, No. 430. Computerra (2002)
INM RAS cluster. http://cluster2.inm.ras.ru. Accessed 15 June 2016 (in Russian)
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS, Boston (1996)
Vassilevski, Y., Konshin, I., Kopytov, G., Terekhov, K.: INMOST - A Software Platform and Graphical Environment for Development of Parallel Numerical Models on General Meshes. Moscow State University Publ., Moscow (2013). (in Russian)
INMOST - a toolkit for distributed mathematical modeling. http://www.inmost.org. Accessed 15 June 2016
PETSc (Portable, Extensible Toolkit for Scientific Computation). https://www.mcs.anl.gov/petsc. Accessed 15 June 2016
Acknowledgements
This work has been supported in part by RSF grant No. 14-11-00190.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Konshin, I. (2016). Parallel Computational Models to Estimate an Actual Speedup of Analyzed Algorithm. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2016. Communications in Computer and Information Science, vol 687. Springer, Cham. https://doi.org/10.1007/978-3-319-55669-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-55669-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55668-0
Online ISBN: 978-3-319-55669-7
eBook Packages: Computer ScienceComputer Science (R0)