Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Clinton P. T. Groth

dblp:67/9740 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing systems
adaptive mesh refinement
0.021998
Adaptive Parallel Computation of a Grand-Challenge Problem: Prediction of the Path of a Solar-Corona Mass Ejection · SC 1998
Adaptive Blocks: A High Performance Data Structure · SC 1997
High-performance computing › scientific computing systems
magnetohydrodynamic simulation
0.021998
Adaptive Parallel Computation of a Grand-Challenge Problem: Prediction of the Path of a Solar-Corona Mass Ejection · SC 1998
Adaptive Blocks: A High Performance Data Structure · SC 1997
High-performance computing
scientific computing systems
0.021998
Adaptive Parallel Computation of a Grand-Challenge Problem: Prediction of the Path of a Solar-Corona Mass Ejection · SC 1998
Adaptive Blocks: A High Performance Data Structure · SC 1997

Methods — techniques the papers use, named apart from their topics

adaptive mesh refinement · 0.1asynchronous message passing · 0.0
YearPublicationVenuePosition
1998 Adaptive Parallel Computation of a Grand-Challenge Problem: Prediction of the Path of a Solar-Corona Mass Ejection
abstract
One of the ways that the Sun interacts with the Earth is through the solar wind, which is an ionized multi-component fluid that emanates from the Sun and travels radially outward at hundreds of kilometers per second. Solar-wind transients, such as Coronal Mass Ejections (CME's), can be particularly important. In rare cases, CME's have affected the lower atmosphere of the Earth, causing regional power-grid failures. More regularly, CME's pose threats to satellites and spacecraft. Due to the extreme range of temporal and spatial scales involved in solar-wind phenomena, it had previously been impossible to predict CME propagation to Earth with faster-than-real-time, well-resolved calculations. Our team has now developed a highly scalable solution-adaptive scheme for predicting CME propagation. The solution-adaptive technique is an adaptive mesh refinement (AMR) scheme for magneto- hydrodynamic (MHD) calculations. The physical domain is decomposed into three- dimensional blocks, where each block forms a regular grid. In regions of relatively high gradients, blocks are successively refined. Blocks are distributed to processors, with communication between neighboring blocks is handled by asynchronous message passing. The benchmark calculation achieved 212 Gflops on a 1024-processor Cray T3E-1200, with the grid adapting over the course of the calculation from 2048 blocks to 11,729 blocks, where each block was composed of 10x10x10 cells. On a 512-processor Cray T3E-600, our benchmark simulations were performed 16 times faster than real time.
Quentin F. Stout, Darren De Zeeuw, Tamas I. Gombosi, Clinton P. T. Groth, Hal G. Marshall, Kenneth G. Powell
SC4
1997 Adaptive Blocks: A High Performance Data Structure
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.
Quentin F. Stout, Darren De Zeeuw, Tamas I. Gombosi, Clinton P. T. Groth, Hal G. Marshall, Kenneth G. Powell
SC4