Walter J. Ashworth

dblp:391/6056 · also W. Jay Ashworth · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0006-8395-3529ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers
Cloud and datacenter computing · 44% Electronic design automation · 44% Memory systems · 7%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › functional verification › emulation
full-system emulation
1.922026
Flux Fiction: Hopping Toward Storage Graph Scheduling With El Capitan's Rabbits · HPDC 2026
Flux Emulator: First Insights into Optimizing Scheduling for Exascale HPC · HPDC 2025
Cloud and datacenter computing
job scheduling
1.922026
Flux Fiction: Hopping Toward Storage Graph Scheduling With El Capitan's Rabbits · HPDC 2026
Flux Emulator: First Insights into Optimizing Scheduling for Exascale HPC · HPDC 2025
Memory systems
non-volatile memory
0.312026
Flux Fiction: Hopping Toward Storage Graph Scheduling With El Capitan's Rabbits · HPDC 2026

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

queueing policy evaluation · 1.0job trace replay · 1.0graph-based scheduling · 0.9conservative backfilling · 0.9
YearPublicationVenuePosition
2026 Flux Fiction: Hopping Toward Storage Graph Scheduling With El Capitan's Rabbits
abstract
Modern HPC systems are placing increasing demands on job schedulers due to their scale and novel hardware. El Capitan’s Rabbit nodes exemplify this challenge: unlike traditional systems where storage is remote and shared, Rabbit nodes wire local NVMe SSDs directly to compute nodes via PCIe, forcing schedulers to actively track storage topology, capacity, and cross-job persistence, concerns they were never designed to handle. We introduce Flux Fiction, a fully plugin-based HPC system emulator built on top of Flux that replays historical job traces to evaluate scheduling policies in Flux. We validate Flux Fiction against the LLNL Tuolumne cluster using two workloads across four queueing policies, achieving a P99-bounded slowdown error below 1 in 7 of 8 experiments and a maximum utilization error of 1.2%. We then use Flux Fiction to explore Rabbit storage scheduling, demonstrating its ability to explore novel scheduling scenarios.
Walter J. Ashworth, Ian Lumsden, Jim Garlick, Mark Grondona, Olga Pearce, Stephanie Brink, Daniel Milroy, Tapasya Patki, Thomas Scogland, Michela Taufer
HPDC1
2025 Visualizing Temperature Hotspots and Their Impact Using the NEX-GDDP-CMIP6 Dataset
abstract
Climate events like tornadoes, hurricanes, and droughts are major twenty-first-century challenges. Mitigation efforts lag due to costly monitoring tools and complex data access. We present a dashboard with long-term temperature and weather trends, using nine global metrics from the NEX-GDDP-CMIP6 dataset, projecting to 2100. Our analysis flags countries facing major wet-bulb temperature hikes, linking these to expected economic impacts. Initial findings suggest that, in a worst-case scenario, some Northern Hemisphere nations may experience over a 10°C wet-bulb temperature rise between 2020 and 2090, potentially causing GDP losses exceeding 30%.
Walter J. Ashworth, Jack D. Marquez, Michela Taufer
eScience1
2025 Flux Emulator: First Insights into Optimizing Scheduling for Exascale HPC
abstract
El Capitan, currently the world's largest supercomputer at 1.742 Ex-aflop/s, introduces challenges in scheduling due to its scale and innovative rabbit nodes, which traditional schedulers cannot efficiently handle. Flux, a resource and job management system, handles dynamic resource allocation tailored for exascale systems through its graph-based scheduler, Fluxion. This work introduces the Flux Emulator, a tool designed to test scheduling policies in Fluxion without impacting production systems. The emulator plugs into the real components of Flux and Fluxion to mimic job execution, emulate resource usage, and collect information on how the job behaves. Preliminary tests show negligible overhead introduced by the emulator and demonstrate its effectiveness in evaluating scheduli ng policies, like conservative backfilling, in a fraction of the time required with a real system.
Walter J. Ashworth, Ian Lumsden, Jim Garlick, Mark Grondona, Olga Pearce, Stephanie Brink, Dewi Yokelson, Daniel Milroy, Tapasya Patki, Thomas Scogland, Michela Taufer
HPDC1
2024 Towards Affordable Reproducibility Using Scalable Capture and Comparison of Intermediate Multi-Run Results
abstract
Ensuring reproducibility in high-performance computing (HPC) applications is a significant challenge, particularly when nondeterministic execution can lead to untrustworthy results. Traditional methods that compare final results from multiple runs often fail because they provide sources of discrepancies only a posteriori and require substantial resources, making them impractical and unfeasible. This paper introduces an innovative method to address this issue by using scalable capture and comparing intermediate multi-run results. By capitalizing on intermediate checkpoints and hash-based techniques with user-defined error bounds, our method identifies divergences early in the execution paths. We employ Merkle trees for checkpoint data to reduce the I/O overhead associated with loading historical data. Our evaluations on the nondeterministic HACC cosmology simulation show that our method effectively captures differences above a predefined error bound and significantly reduces I/O overhead. Our solution provides a robust and scalable method for improving reproducibility, ensuring that scientific applications on HPC systems yield trustworthy and reliable results.
Nigel Tan, Kevin Assogba, Walter J. Ashworth, Befikir Bogale, Franck Cappello, M. Mustafa Rafique, Michela Taufer, Bogdan Nicolae
Middleware3