Adaptive blocks: a high performance data structure

Authors:
Quentin F. Stout;Darren L. De Zeeuw;Tamas I. Gombosi;Clinton P. T. Groth;Hal G. Marshall;Kenneth G. Powell
Affiliations:
University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI
Venue:
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Year:
1997

Citing 1
Cited 5

The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)

Adaptive parallel computation of a grand-challenge problem: prediction of the path of a solar-corona mass ejection

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Hall magnetohydrodynamics on block-adaptive grids

Journal of Computational Physics
A parallel solution - adaptive method for three-dimensional turbulent non-premixed combusting flows

Journal of Computational Physics
Adaptive numerical algorithms in space weather modeling

Journal of Computational Physics
Stability at Nonconforming Grid Interfaces for a High Order Discretization of the Schrödinger Equation

Journal of Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We examine a data structure which uses flexible "adaptivity" to obtain high performance for both serial and parallel computers. The data structure is an adaptive grid which partitions a given region into regular cells. Its closest relatives are cell-based tree decompositions, but there are several important differences which lead to significant performance advantages. Using this block data structure to support adaptive mesh refinement (AMR), we were able to sustain 17 GFLOPS in ideal magnetohydrodynamic (MHD) simulations of the solar wind emanating from the base of the solar corona, using a 512 processor Cray T3D at NASA Goddard.