Scalable Parallel Octree Meshing for TeraScale Applications

We present a new methodology for generating and adapting octree meshes for terascale applications. Our approach combines existing methods, such as parallel octree decomposition and space-filling curves, with a set of new methods that address the special needs of parallel octree meshing. We have implemented these techniques in a parallel meshing tool called Octor. Performance evaluations on up to 2000 processors show that Octor has good isogranular scalability, fixed-size scalability, and absolute running time. Octor also provides a novel data access interface to parallel PDE solvers and parallel visualization pipelines, making it possible to develop tightly coupled end-to-end finite element simulations on terascale systems.

[1]  David R. O'Hallaron,et al.  High Resolution Forward And Inverse Earthquake Modeling on Terascale Computers , 2003, SC.

[2]  D. P. Young,et al.  A locally refined rectangular grid finite element method: application to computational fluid dynamics and computational physics , 1990 .

[3]  Anoop Gupta,et al.  Load Balancing and Data locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Rasiosity , 1995, J. Parallel Distributed Comput..

[4]  David R. O'Hallaron,et al.  A Computational Database System for Generatinn Unstructured Hexahedral Meshes with Billions of Elements , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[5]  Srinivas Aluru,et al.  Parallel domain decomposition and load balancing using space-filling curves , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[6]  A. K. Patra,et al.  Data structures and load balancing for parallel adaptive hp finite-element methods☆ , 2003 .

[7]  Aslak Tveito,et al.  Numerical solution of partial differential equations on parallel computers , 2006 .

[8]  Vipin Kumar,et al.  A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm , 1997, PP.

[9]  Lexing Ying,et al.  A New Parallel Kernel-Independent Fast Multipole Method , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[10]  Anoop Gupta,et al.  A parallel adaptive fast multipole method , 1993, Supercomputing '93. Proceedings.

[11]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[12]  Michael Zingale,et al.  High-Performance Reactive Fluid Flow Simulations Using Adaptive Mesh Refinement on Thousands of Processors , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[13]  Fabrizio Petrini,et al.  Predictive Performance and Scalability Modeling of a Large-Scale Application , 2001, ACM/IEEE SC 2001 Conference (SC'01).

[14]  Mark S. Shephard,et al.  Automatic three-dimensional mesh generation by the finite octree technique , 1984 .

[15]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[16]  Nikos Chrisochoides,et al.  Parallel Mesh Generation , 2006 .

[17]  M. S. Warren,et al.  A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[18]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.

[19]  Michael S. Warren,et al.  A parallel hashed oct-tree N-body algorithm , 1993, Supercomputing '93. Proceedings.

[20]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[21]  Robert W. Graves,et al.  The SCEC Southern California Reference Three-Dimensional Seismic Velocity Model Version 2 , 2000 .

[22]  Kwan-Liu Ma,et al.  From physical modeling to scientific understanding — An end-to-end approach to parallel supercomputing , 2005 .

[23]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[24]  Mark S. Shephard,et al.  Parallel refinement and coarsening of tetrahedral meshes , 1999 .

[25]  Tiankai Tu,et al.  High Resolution Forward And Inverse Earthquake Modeling on Terascale Computers , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[26]  David Eppstein,et al.  Parallel Construction of Quadtrees and Quality Triangulations , 1993, WADS.

[27]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[28]  Nikos Chrisochoides,et al.  Parallel Delaunay mesh generation kernel , 2003 .

[29]  Irene Gargantini,et al.  Linear octtrees for fast processing of three-dimensional objects , 1982, Comput. Graph. Image Process..

[30]  David R. O'Hallaron,et al.  Etree: a database-oriented method for generating large octree meshes , 2004, Engineering with Computers.

[31]  Lionel M. Ni,et al.  Scalable Problems and Memory-Bounded Speedup , 1993, J. Parallel Distributed Comput..

[32]  Srinivas Aluru,et al.  Truly distribution-independent algorithms for the N-body problem , 1994, Proceedings of Supercomputing '94.

[33]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[34]  A.M. Wissink,et al.  Large Scale Parallel Structured AMR Calculations Using the SAMRAI Framework , 2001, ACM/IEEE SC 2001 Conference (SC'01).

[35]  John M. Dennis,et al.  Partitioning with space-filling curves on the cubed-sphere , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[36]  O. Ghattas,et al.  LARGE-SCALE NORTHRIDGE EARTHQUAKE SIMULATION USING OCTREE-BASED MULTIRESOLUTION MESH METHOD , 2003 .

[37]  J. D. Teresco,et al.  Parallel structures and dynamic load balancing for adaptive finite element computation , 1998 .

[38]  Tom Abel,et al.  The Formation and Fragmentation of Primordial Molecular Clouds , 1999 .