Parallel Algorithms for an Implicit CFD Solver on Tree-Based Grids
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.
KeywordsCFD CUDA LU-SGS Implicit schemes Parallel algorithms Tree-based grids AMR
This research was supported by the Grant No. 17-71-30014 from the Russian Scientific Fund.
- 5.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)Google Scholar
- 7.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)Google Scholar
- 10.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 CrossRefGoogle Scholar