Abstract
Parallel implementation of the implicit LU-SGS solver is considered. It leads to the graph coloring problem. A novel recursive graph coloring algorithm has been proposed that requires only three colors on 2:1 balanced quadtree-based meshes. The algorithm has been shown to allow simple parallel implementations, including GPU architectures, and is fully coherent with local grid coarsing/refining procedures resulting in highly effective co-execution with local grid adaptation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Menshov, I.S., Pavlukhin, P.V.: Efficient parallel shock-capturing method for aerodynamics simulations on body-unfitted cartesian grids. Comput. Math. Math. Phys. 56(9), 1651–1664 (2016)
Menshov, I., Nakamura, Y.: Hybrid explicit-implicit, unconditionally stable scheme for unsteady compressible flows. AIAA J. 42(3), 551–559 (2004)
Jameson, A., Turkel, E.: Implicit schemes and LU decomposition. Math. Comp. 37, 385–397 (1981)
Menshov, I., Nakamura, Y.: On implicit Godunov’s method with exactly linearized numerical flux. Comput. Fluids 29(6), 595–616 (2000)
Beckingsale, D., Gaudin, W., Herdman, A., Jarvis, S.: Resident block-structured adaptive mesh refinement on thousands of graphics processing units. In: 2015 44th International Conference on Parallel Processing Parallel Processing (ICPP), pp. 61–70. IEEE (2015)
Lawlor, O.S., Chakravorty, S., Wilmarth, T.L., Choudhury, N., Dooley, I., Zheng, G., Kal, L.V.: ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applications. Eng. Comput. 22(3–4), 215–235 (2006)
Pavlukhin, P.: Parallel LU-SGS numerical method implementation for gas dynamics problems on GPU-accelerated computer systems. Vestn. Lobachevsky State Univ. Nizhni Novgorod 1, 213–218 (2013)
Pavlukhin, P., Menshov, I.: On implementation high-scalable CFD solvers for hybrid clusters with massively-parallel architectures. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 436–444. Springer, Cham (2015). doi:10.1007/978-3-319-21909-7_42
Bozdag, D., Gebremedhin, A.H., Manne, F., Boman, E.G., Catalyurek, U.V.: A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distrib. Comput. 68(4), 515–535 (2008)
Boman, E.G., Bozdağ, D., Catalyurek, U., Gebremedhin, A.H., Manne, F.: A scalable parallel graph coloring algorithm for distributed memory computers. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 241–251. Springer, Heidelberg (2005). doi:10.1007/11549468_29
Acknowledgement
This research was supported by the Grant No. 17-71-30014 from the Russian Scientific Fund.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Pavlukhin, P., Menshov, I. (2017). Parallel Algorithms for an Implicit CFD Solver on Tree-Based Grids. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2017. Lecture Notes in Computer Science(), vol 10421. Springer, Cham. https://doi.org/10.1007/978-3-319-62932-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-62932-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62931-5
Online ISBN: 978-3-319-62932-2
eBook Packages: Computer ScienceComputer Science (R0)