Location of Repository

GENERIC FINITE ELEMENT PROGRAMMING FOR MASSIVELY PARALLEL FLOW SIMULATIONS

By J. C. F. Pereira, A. Sequeira (eds, Timo Heister, Martin Kronbichler and Wolfgang Bangerth

Abstract

Abstract. We present design issues, data structures and algorithms which allow us to leverage the power of high performance computer clusters in generic finite element codes. Large scale flow simulations require parallel algorithms to scale to thousands of processor cores. Simple parallelization in generic finite element codes often reduces to implementing parallel linear algebra and solvers or interfacing with an existing parallel linear algebra library. Other data structures and algorithms, e.g. mesh handling, are not designed for parallel computations and introduce bad scaling and memory constraints. Scaling to more than about one hundred cores and a few million of unknowns is not feasible. Today’s computer clusters have up to tens of thousands of cores and are the foundation to deal with large scale numerical problems. Generic finite element codes, like deal.II 4, 5, feature methods for rapid and flexible development, higher order elements and adaptivity. To take advantage of those features in large parallel computer clusters, e.g. in flow simulations, many parts of the library have to be adapted and tailored to scale. We describe the steps done in enabling deal.II to scale from less than a hundre

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.185.4715
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.tamu.edu/%7Eba... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.