Seth Ockerman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Seth Ockerman has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Amal Gueroudji
Argonne National Laboratory
5 shared publications - Robert Ross
Argonne National Laboratory, Lemont, USA
3 shared publications - Shivaram Venkataraman
University of Wisconsin-Madison, Madison, WI, USA
3 shared publications - Banooqa Banday
Texas State University
2 shared publications - Line Pouchard
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
2 shared publications - Adrian Perez Dieguez
Qualcomm Technologies, Inc., San Diego, USA
1 shared publication
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 683-695
A Distributed Framework for Causal Modeling of Performance Variability in GPU Traces
- 2 July 2026
- Published by Springer Nature
- p. 683-695
A Distributed Framework for Causal Modeling of Performance Variability in GPU Traces
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 575-581
Exploring Distributed Vector Databases Performance on HPC Platforms: A Study with Qdrant
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 575-581
Open AccessExploring Distributed Vector Databases Performance on HPC Platforms: A Study with Qdrant
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-236
PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-236
Open AccessPGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training
- Open Access
A Distributed Framework for Causal Modeling of Performance Variability in GPU Traces
Large-scale GPU traces play a critical role in identifying performance bottlenecks within heterogeneous High-Performance Computing (HPC) architectures. However, the sheer volume and complexity of a single trace of data make performance analysis both computationally expensive and time-consuming. To address this challenge, we present an end-to-end parallel performance analysis framework designed to handle multiple large-scale GPU traces efficiently. Our proposed framework partitions and processes trace data concurrently and employs causal graph methods and parallel coordinating chart to expose performance variability and dependencies across execution flows. Experimental results demonstrate a 67% improvement in terms of scalability, highlighting the effectiveness of our pipeline for analyzing multiple traces independently.
Open AccessA Distributed Framework for Causal Modeling of Performance Variability in GPU Traces
Large-scale GPU traces play a critical role in identifying performance bottlenecks within heterogeneous High-Performance Computing (HPC) architectures. However, the sheer volume and complexity of a single trace of data make performance analysis both computationally expensive and time-consuming. To address this challenge, we present an end-to-end parallel performance analysis framework designed to handle multiple large-scale GPU traces efficiently. Our proposed framework partitions and processes trace data concurrently and employs causal graph methods and parallel coordinating chart to expose performance variability and dependencies across execution flows. Experimental results demonstrate a 67% improvement in terms of scalability, highlighting the effectiveness of our pipeline for analyzing multiple traces independently.
- 23 July 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (5) , 631-654
Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization
In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.
- 23 July 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (5) , 631-654
Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization
In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.
- Open Access
- 4 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 79-92
Towards Empirical Roofline Modeling of Distributed Data Services: Mapping the Boundaries of RPC Throughput
- 4 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 79-92
Open AccessTowards Empirical Roofline Modeling of Distributed Data Services: Mapping the Boundaries of RPC Throughput
- Open Access
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 35-41
Evaluating Parallel Sliding Window Techniques
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 35-41
Open AccessEvaluating Parallel Sliding Window Techniques