A massively parallel adaptive finite element method with dynamic load balancing

Conference · Fri Dec 31 04:00:00 EST 1993

OSTI ID:46201

Devine, K D; Flaherty, J E ^[1]; Wheat, S R ^[2]; Maccabe, A B ^[3]

---

1. Rensselaer Polytechnic Institute, Troy, NY (United States). Dept. of Computer Science
2. Sandia National Labs., Albuquerque, NM (United States). Massively Parallel Computing Research Lab.
3. Univ. of New Mexico, Albuquerque, NM (United States). Dept. of Computer Science

The authors construct massively parallel adaptive finite element methods for the solution of hyperbolic conservation laws. Spatial discretization is performed by a discontinuous Galerkin finite element method using a basis of piecewise Legendre polynomials. Temporal discretization utilizes a Runge-Kutta method. Dissipative fluxes and projection limiting prevent oscillations near solution discontinuities. The resulting method is of high order and may be parallelized efficiently on MIMD computers. They demonstrate parallel efficiency through computations on a 1024-processor nCUBE/2 hypercube. They present results using adaptive p-refinement to reduce the computational cost of the method, and tiling, a dynamic, element-based data migration system that maintains global load balance of the adaptive method by overlapping neighborhoods of processors that each perform local balancing.

• Research Organization: Sandia National Laboratory
• DOE Contract Number: AC04-76DP00789
• OSTI ID: 46201
• Report Number(s): CONF-931115--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPUTER ARCHITECTURE
CONSERVATION LAWS
FINITE ELEMENT METHOD
GALERKIN-PETROV METHOD
HYPERCUBE COMPUTERS
PARALLEL PROCESSING
PERFORMANCE