headerlogo
scyourway
Student Contribution

SC Conference - Activity Details



Dendro: Parallel Algorithms for Multigrid and AMR Methods on 2:1 Balanced Octrees

Authors:
Rahul S. Sampath  (University of Pennsylvania)
Santi S. Adavani  (University of Pennsylvania)
Hari Sundar  (University of Pennyslvania)
Ilya Lashuk  (University of Pennsylvania)
George Biros  (University of Pennsylvania)
Papers Session
Large-Scale Applications
Tuesday,  02:30PM - 03:00PM
Room Ballroom E
Abstract:
In this article, we present Dendro, a suite of parallel algorithms for the discretization and solution of partial differential equations involving second-order elliptic operators. Dendro uses trilinear finite element discretizations constructed using octrees. Dendro, comprises four main modules: a bottom-up octree generation and 2:1 balancing module, a meshing module, a geometric multiplicative multigrid module, and a module for adaptive mesh refinement (AMR). Here, we focus on the multigrid and AMR modules. The key features of Dendro are coarsening/refinement, inter-octree transfers of scalar and vector fields, and parallel partition of multilevel octree forests. We describe an algorithm for constructing the coarser multigrid levels starting with an arbitrary 2:1 balanced fine grid octree discretization. We present results on up to 4096 CPUs on the Cray XT3 (``BigBen'') , the Intel 64 system (``Abe'') and the Sun Constellation Linux cluster (``Ranger'').
The full paper can be found in the IEEE Xplore Digital Library and ACM Digital Library
   IEEE Computer Society  /  ACM     2 0   Y E A R S   -   U N L E A S H I N G   T H E   P O W E R   O F   H P C