Chaco

Shen, Xiaowei; Torrellas, Josep; Tuckerman, Mark E.; Bohm, Eric J.; Martyna, Glenn; Yew, Pen-Chung; Hofstee, H. Peter; Sottile, Matthew; Hendrickson, Bruce; Chamberlain, Bradford L.; Schulz, Martin; Leiserson, Charles E.; Sterling, Thomas; Siewiorek, Daniel P.; Gehringer, Edward F.; Numrich, Robert W.; Bastoul, Cédric; Geijn, Robert A.; Träff, JesperLarsson; Panda, Dhabaleswar K.; Sur, Sayantan; Subramoni, Hari; Kandalla, Krishna; Kalé, Laxmikant V.; Jetley, Pritish; Worley, Patrick H; Vertenstein, Mariana; Craig, Anthony P; Fox, Geoffrey; Hart, John C.; Burke, Michael G.; Knobe, Kathleen; Newton, Ryan; Sarkar, Vivek; Reppy, John; García, Pedro J.; Steele, Guy L.; Swensen, John; Souli, M’hamed; Prince, Timothy; Wang, Jason; Dungworth, Michael; Harrell, James; Levine, Michael; Nelson, Stephen; Oberlin, Steven; Reinhardt, Steven P.; Schwarzmeier, James L.; Kaplan, Larry; Brooks, Jeff; Kirschner, Gerry; Abts, Dennis; Roscoe, A. W.; Davies, Jim; Denneau, Monty; Schlansker, Michael

doi:10.1007/978-0-387-09766-4_310

Cited by 2 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The decomposition is achieved by a graph partitioning software (e.g. Scotch [37], Metis [27], Chaco [23]). For the sake of simplicity, the parallel versions of these softwares (such as PT-Scotch [9] or Parmetis [26]) are not used here as their sequential counterparts remains efficient on the coarse mesh even wh en the number of subdomains becomes important.…”

Section: Sequential Decompositionmentioning

confidence: 99%

See 1 more Smart Citation

Two-level substructuring and parallel mesh generation for domain decomposition methods

Gharbi

Parret-Fréaud

Bovet

et al. 2021

Finite Elements in Analysis and Design

View full text Add to dashboard Cite

This paper presents a new parallel mesh generation method leading to subdomains of shape well-suited to Schur based domain decomposition methods such as the FETI and BDD solvers. Starting from a coarse mesh, subdomains meshes are created in parallel through hierarchical mesh refinement and morphing techniques. The proposed methodology aims at limiting the occurrence of known pathological situations (jagged interfaces, misplaced heterogeneity with respect to the interfaces, . . . ) that penalize the convergence of the solver. Furthermore, it enables to distribute and parallelize the mesh generation step in the early phases of the whole analysis. Besides its good behavior towards convergence, the mesh generation is thus distributed. The method is assessed, on several academical and industrial test cases, for both its parallel efficiency when creating the mesh and its capability to generate decomposition resulting in less FETI iterations.

show abstract

Section: Sequential Decompositionmentioning

confidence: 99%

“…mesh generation on the global structure, possibly of large size, with a sequential mesher (or its fine-grained parallel counterpart [29]); 2. substructuring of the associated connectivity graph with a partitioning software (e.g. Metis [27], Scotch [37], Chaco [23]. .…”

Section: Introductionmentioning

confidence: 99%

Two-level substructuring and parallel mesh generation for domain decomposition methods

Gharbi

Parret-Fréaud

Bovet

et al. 2021

Finite Elements in Analysis and Design

View full text Add to dashboard Cite

show abstract

“…Substructuring with a partitioning software of the associated connectivity graph (e.g. Metis [7], Scotch [8], Chaco [9]...) or with a Binary Space Partitioning tree of the position of elements (KD-tree [10], RP-tree, MM-tree...).…”

Section: Introductionmentioning

confidence: 99%

Parallel preprocessing with subdomain's shape control for domain decomposition methods

Gharbi¹,

Gosselet²,

Parret-Fréaud³

et al.

The Sixth International Conference on Parallel, Distributed, GPU and Cloud Computing for Engineering

View full text Add to dashboard Cite

Solving highly heterogeneous structural mechanic problems with a large number of degrees of freedom (HPC simulations) is a real issue in engineering work, because of the required time and memory. Non overlapping domain decomposition methods such as the Finite Element Tearing and Interconnecting (FETI) or Balanced Domain Decomposition (BDD) methods have been developed in order to allocate the problems on distributed memory clusters with a large number of processors and to make mechanical calculations parallel.Two difficulties are encountered when applying domain decomposition methods. First, the mesh generation is most often a sequential process applied to the full domain. Second, the linear system resulting from the partitioning of the mesh may be poorly conditioned, leading to slow convergence. Recently developed techniques such as adapted coarse spaces (e.g. FETI-GenEO) or multipreconditioning (e.g. AMPFETI) enable to restore good convergence rate, at the cost of extra computations.In this study, we try to mitigate these two difficulties by proposing a new hierarchical substructuring method which aims at making the mesh preprocessing step parallel and at improving the condition number of the linear system to be solved by generating regular interfaces adapted to the heterogeneity.

show abstract

Chaco

Cited by 2 publications

References 0 publications

Two-level substructuring and parallel mesh generation for domain decomposition methods

Two-level substructuring and parallel mesh generation for domain decomposition methods

Parallel preprocessing with subdomain's shape control for domain decomposition methods

Contact Info

Product

Resources

About