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

Paul R. Woodward

dblp:68/866 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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
3 papers
High-performance computing · 76% Memory systems · 12% Performance modeling and evaluation · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing systems
computational fluid dynamics
0.011999
Very High Resolution Simulation of Compressible Turbulence on the IBM-SP System · SC 1999
High-performance computing
performance optimization at scale
0.011999
Very High Resolution Simulation of Compressible Turbulence on the IBM-SP System · SC 1999
High-performance computing › supercomputing
petascale computing
0.011999
Portable Petaflop/s Programming: Applying Distributed Computing Methodology to the Grid within a Single Machine Room · HPDC 1999
Performance modeling and evaluation › simulation › parallel and distributed simulation
parallel simulation
0.011995
Distributed Computing on Clusters of Share' d-Memory Multiprocessors to Simulate Unsteady Turbulent Flows · HPDC 1995
High-performance computing › scientific computing systems › computational fluid dynamics
turbulence simulation
0.011995
Distributed Computing on Clusters of Share' d-Memory Multiprocessors to Simulate Unsteady Turbulent Flows · HPDC 1995
Memory systems › shared memory
distributed shared memory
0.011999
Portable Petaflop/s Programming: Applying Distributed Computing Methodology to the Grid within a Single Machine Room · HPDC 1999
Memory systems › memory hierarchy
memory hierarchy management
0.011999
Portable Petaflop/s Programming: Applying Distributed Computing Methodology to the Grid within a Single Machine Room · HPDC 1999
High-performance computing
cluster computing
0.011995
Distributed Computing on Clusters of Share' d-Memory Multiprocessors to Simulate Unsteady Turbulent Flows · HPDC 1995

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

parallel i/o · 0.0high-resolution 3d simulation · 0.0threads · 0.0self-scheduled task list · 0.0dynamic load balancing · 0.0MPI · 0.0distributed computing · 0.0
YearPublicationVenuePosition
2016 Transforming the multifluid PPM algorithm to run on GPUs
Pei-Hung Lin, Paul R. Woodward
J. Parallel Distributed Comput.2
2009 First experience of compressible gas dynamics simulation on the Los Alamos roadrunner machine
abstract
Abstract We report initial experience with gas dynamics simulation on the Los Alamos Roadrunner machine. In this initial work, we have restricted our attention to flows in which the flow Mach number is less than 2. This permits us to use a simplified version of the PPM gas dynamics algorithm that has been described in detail by Woodward (2006). We follow a multifluid volume fraction using the PPB moment‐conserving advection scheme, enforcing both pressure and temperature equilibrium between two monatomic ideal gases within each grid cell. The resulting gas dynamics code has been extensively restructured for efficient multicore processing and implemented for scalable parallel execution on the Roadrunner system. The code restructuring and parallel implementation are described and performance results are discussed. For a modest grid size, sustained performance of 3.89 Gflops−1 CPU‐core−1 is delivered by this code on 36 Cell processors in 9 triblade nodes of a single rack of Roadrunner hardware. Copyright © 2009 John Wiley & Sons, Ltd.
Paul R. Woodward, Jagan Jayaraj, Pei-Hung Lin, William Dai
Concurr. Comput. Pract. Exp.1
2005 A System for Interactive Volume Visualization on the PowerWall
Paul R. Woodward, David H. Porter, Michael R. Knox, Steven T. Andringa, Alex J. Larson, Aaron Stender
IEEE Visualization1
1999 Portable Petaflop/s Programming: Applying Distributed Computing Methodology to the Grid within a Single Machine Room
abstract
According to today's best projections, petaFLOP/s computing platforms will combine deep memory hierarchies in both latency and bandwidth with a need for many-thousand-fold parallelism. Unless effective parallel programs are prepared in advance, much of the promise of the first year or two of operation for these systems may be lost. We introduce a candidate for a portable petaFLOP/s programming model that can enable these important early application programs to be developed while, at the same time, permitting these same applications to run efficiently on the most capable computing systems now available. An MPI-based model is portable, but its programming paradigm ignores the potential benefits of hardware support for shared memory within each network node. A threads-based model cannot directly cope with the distributed nature of the memory over the network. Therefore, a new, portable programming model is needed. The shared memory programming model dramatically simplifies the expression of dynamic load balancing strategies for irregular algorithms. The main strategy is a transparent self-scheduled task list performed in parallel so long as specified data-dependent conditions are met. The model used is a cluster of multiprocessor distributed shared memory machines with network-attached disks. Our experimental run-time system allows the programmer to view this computing platform as a single machine with a four-stage memory hierarchy, consisting of coherent processor cache, non-coherent local shared memory, global shared memory, plus a global disk file system.
Paul R. Woodward, Sarah E. Anderson
HPDC1
1999 Very High Resolution Simulation of Compressible Turbulence on the IBM-SP System
abstract
Understanding turbulence and mix in compressible flows is of fundamental importance to real-world applications such as chemical combustion and supernova evolution.The ability to run in three dimensions and at very high resolution is required for the simulation to accurately represent the interaction of the various length scales, and consequently, the reactivity of the intermixing species.Toward this end, we have carried out a very high resolution (over 8 billion zones) 3-D simulation of the Richtmyer-Meshkov instability and turbulent mixing on the IBM Sustained Stewardship TeraOp (SST) system, developed under the auspices of the Department of Energy (DOE) Accelerated Strategic Computing Initiative (ASCI) and located at Lawrence Livermore National Laboratory.We have also undertaken an even higher resolution proofof-principle calculation (over 24 billion zones) on 5832 processors of the IBM system, which executed for over an hour at a sustained rate of 1.05 Tflop/s, as well as a short calculation with a modified algorithm that achieved a sustained rate of 1.18 Tflop/s.The full production scientific simulation, using a further modified algorithm, ran for 27,000 timesteps in slightly over a week of wall time using 3840 processors of the IBM system, clocking a sustained throughput of roughly 0.6 teraflop per second (32-bit arithmetic).Nearly 300,000 graphics files comprising over three terabytes of data were produced and post-processed.The capability of running in 3-D at high resolution enabled us to get a more accurate and detailed picture of the fluidflow structure -in particular, to simulate the development of fine scale structures from the interactions of long-and short-wavelength phenomena, to elucidate differences between twodimensional and three-dimensional turbulence, to explore a conjecture regarding the transition from unstable flow to fully developed turbulence with increasing Reynolds number, and to ascertain convergence of the computed solution with respect to mesh resolution.
Arthur A. Mirin, Ron H. Cohen, Bruce C. Curtis, William P. Dannevik, Andris M. Dimits, M. A. Duchauneau, Don E. Eliason, Daniel Schikore, Sarah E. Anderson, David H. Porter, Paul R. Woodward, L. J. Shieh, Steven W. White
SC11
1995 Distributed Computing on Clusters of Share' d-Memory Multiprocessors to Simulate Unsteady Turbulent Flows
Paul R. Woodward
HPDC1