Abstract
The article considers the problems of parallelization of finite-volume numerical methods concerning the calculation of the streaming flow of conservative quantities through the boundaries of computational cells for systems operating with shared memory. Three approaches to solving this problem were analyzed, for which a theoretical justification was carried out, implementation, testing, analysis of the performance and scalability of the proposed methods were performed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vorobyov, E.S., Vorobiev, V.E.: Numerical methods and mathematical modeling. Fundamentals of numerical methods and techniques for building mathematical models based on them and these solutions in various packages, Kazan (2017)
Rybakov, A.A.: Distribution of the computational load between the nodes of a heterogeneous computing cluster. Progr. Products Syst. Algorithms 1, 1–7 (2018)
Golovchenko, E.: Overview of Graph Decomposition Algorithms. Preprint IPM № 002 (IPM named after M. V. Keldysh) (2020)
Rybakov, A.: Internal representation and mechanism of interprocess exchange for a block grid for supercomputing. Software products and systems. Algorithmiya 8(1), 121–134 (2017)
Software Developer’s Guide for Intel 64 and IA-32 Architectures (Intel Corp.), Consolidated Volumes: 1, 2A, 2B, 2C, 2D, 3A, 3B, 3C, 3D, and 4 (2019)
Jeffers, J., Reinders, J., and Sodani, A.: High-Performance Programming of Intel Xeon Phi Processors, Knights Landing Edition. Morgan Kaufmann, Burlington (2016)
Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, pp. 138–144 (2009)
Blazek, J.: Computational Fluid Dynamics: Principles and Applications. Elsevier, Amsterdam (2001)
Molloy, M., Reed, B.: Graph colouring and the probabilistic method. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-642-04016-0
Korte, B., Vygen, J.: Combinatorial Optimization Theory and Algorithms. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-56039-6
Anferov, M.A.: Algorithm for searching subcritical paths on network graphs. Russian Technol. J. 11(1), 60–69 (2023)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gulicheva, A. (2024). Parallelization of Finite-Volume Numerical Methods of Computational Fluid Dynamics by Means of Shared Memory Computing Systems. In: Jordan, V., Tarasov, I., Shurina, E., Filimonov, N., Faerman, V.A. (eds) High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production. HPCST 2023. Communications in Computer and Information Science, vol 1986. Springer, Cham. https://doi.org/10.1007/978-3-031-51057-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-51057-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-51056-4
Online ISBN: 978-3-031-51057-1
eBook Packages: Computer ScienceComputer Science (R0)