38th Aerospace Sciences Meeting and Exhibit 2000
DOI: 10.2514/6.2000-927
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of unstructured grid GMRES+LU-SGS method on shared-memory, cache-based parallel computers

Abstract: The implementation of an unstructured grid matrix-free GMRES+LU-SGS scheme on shared-memory, cache-based parallel machines is described. A special grid renumbering technique is used for the parallelization rather than the traditional method of partitioning the computational domain. The renumbering technique helps to avoid inter-processor data dependencies, cache-misses, and cache-line overwrite while allowing pipelining. The resulting source code can be used with maximum efficiency and without modifications on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2003
2003
2021
2021

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(27 citation statements)
references
References 28 publications
0
27
0
Order By: Relevance
“…During the last one and half decades, the unstructured grid methodology has clearly demonstrated its flexibility in tackling complex geometries, and in flow-based grid adaptations [5][6][7][8][9][10][11][12]. The success demonstrated by the unstructured grid method for steady flow problems has prompted considerable development for unsteady moving boundary problems.…”
Section: Discussionmentioning
confidence: 99%
“…During the last one and half decades, the unstructured grid methodology has clearly demonstrated its flexibility in tackling complex geometries, and in flow-based grid adaptations [5][6][7][8][9][10][11][12]. The success demonstrated by the unstructured grid method for steady flow problems has prompted considerable development for unsteady moving boundary problems.…”
Section: Discussionmentioning
confidence: 99%
“…For unstretched grids, LU-SGS works as in its original algorithm. Other techniques are investigated in this paper to improve the efficiency of LU-SGS by Message Passing Interface (MPI) (Barney 2014) parallelization (Wright et al 1995;Wissink et al 1997;Sharov et al 2000;Luo et al 2003) and node ordering techniques (George and Liu 1981;Borne 2000). First results have been presented (Otero and Eliasson 2013) and are improved in the present paper following a parameter study previously carried out (Otero and Eliasson 2014).…”
Section: Introductionmentioning
confidence: 99%
“…First developed for structured grids by Jameson and Yoon (1987), then successfully extended to hybrid structured-unstructured grids (Soetrisno et al 1996;Sharov and Nakahashi 1998), LU-SGS has been improved through different methods. The definition of a proper implicit operator (Chen and Wang 2000;Kim and Kwon 2005;Dwight 2006) and the combination with the GMRES solver as a preconditioning method (Sharov et al 2000;Nejat and Ollivier-Gooch 2005) are some of them. The method considers a linearization which is inexactly solved by a few steps of a symmetric Gauss-Seidel method through a forward and backward sweep.…”
Section: Introductionmentioning
confidence: 99%
“…Over the last three years, FEFLO has been ported to both shared memory [26][27][28] and distributed memory [19, 29, and 30] (16) In order to simplify the algebra involved (and CPU), one may use, without noticeable deterioration of results:…”
Section: Comparison With Experimental Datamentioning
confidence: 99%