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

Samuel Temple Reeve

dblp:196/2668 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-4250-9476ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
1 paper
Parallel and multicore computing · 40% Performance modeling and evaluation · 20% High-performance computing · 20%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › load balancing
dynamic load balancing
0.712023
A Sparse Distributed Gigascale Resolution Material Point Method · ACM Trans. Graph. 2023
GPUs and heterogeneous computing
heterogeneous programming models
0.712023
A Sparse Distributed Gigascale Resolution Material Point Method · ACM Trans. Graph. 2023
Parallel and multicore computing
load balancing
0.712023
A Sparse Distributed Gigascale Resolution Material Point Method · ACM Trans. Graph. 2023
Performance modeling and evaluation › simulation › parallel and distributed simulation
parallel simulation
0.712023
A Sparse Distributed Gigascale Resolution Material Point Method · ACM Trans. Graph. 2023
High-performance computing › performance engineering
performance portability
0.712023
A Sparse Distributed Gigascale Resolution Material Point Method · ACM Trans. Graph. 2023

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

OpenMP · 0.7MPI · 0.7CUDA · 0.7
YearPublicationVenuePosition
2023 A Sparse Distributed Gigascale Resolution Material Point Method
abstract
In this article, we present a four-layer distributed simulation system and its adaptation to the Material Point Method (MPM). The system is built upon a performance portable C++ programming model targeting major High-Performance-Computing (HPC) platforms. A key ingredient of our system is a hierarchical block-tile-cell sparse grid data structure that is distributable to an arbitrary number of Message Passing Interface (MPI) ranks. We additionally propose strategies for efficient dynamic load balance optimization to maximize the efficiency of MPI tasks. Our simulation pipeline can easily switch among backend programming models, including OpenMP and CUDA, and can be effortlessly dispatched onto supercomputers and the cloud. Finally, we construct benchmark experiments and ablation studies on supercomputers and consumer workstations in a local network to evaluate the scalability and load balancing criteria. We demonstrate massively parallel, highly scalable, and gigascale resolution MPM simulations of up to 1.01 billion particles for less than 323.25 seconds per frame with 8 OpenSSH-connected workstations.
Yuxing Qiu, Samuel Temple Reeve, Minchen Li, Yin Yang 0002, Stuart R. Slattery, Chenfanfu Jiang
ACM Trans. Graph.2
2021 Adaptive Spatially Aware I/O for Multiresolution Particle Data Layouts
abstract
Large-scale simulations on nonuniform particle distributions that evolve over time are widely used in cosmology, molecular dynamics, and engineering. Such data are often saved in an unstructured format that neither preserves spatial locality nor provides metadata for accelerating spatial or attribute subset queries, leading to poor performance of visualization tasks. Furthermore, the parallel I/O strategy used typically writes a file per process or a single shared file, neither of which is portable or scalable across different HPC systems. We present a portable technique for scalable, spatially aware adaptive aggregation that preserves spatial locality in the output. We evaluate our approach on two supercomputers, Stampede2 and Summit, and demonstrate that it outperforms prior approaches at scale, achieving up to 2.5 x faster writes and reads for nonuniform distributions. Furthermore, the layout written by our method is directly suitable for visual analytics, supporting low-latency reads and attribute-based filtering with little overhead.
Will Usher 0001, Xuan Huang 0007, Steve Petruzza, Sidharth Kumar, Stuart R. Slattery, Samuel Temple Reeve, Feng Wang 0013, Chris R. Johnson 0001, Valerio Pascucci
IPDPS6