Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.08207

Aurora: Architecting Argonne's First Exascale Supercomputer for Accelerated Scientific Discovery

William E. Allcock·Benjamin S. Allen·James Anchell·Victor Anisimov·Thomas Applencourt·Abhishek Bagusetty·Ramesh Balakrishnan·Riccardo Balin·Solomon Bekele·Colleen Bertoni·Cyrus Blackworth·Renzo Bustamante·Kevin Canada·John Carrier·Christopher Chan-nui·Lance C. Cheney·Taylor Childers·Paul Coffman·Susan Coghlan·Tanima Dey·Michael D'Mello·Ashok Emani·Murali Emani·Kyle G. Felker·Sam Foreman·Olivier Franza·Longfei Gao·Marta García·María Garzarán·Balazs Gerofi·Yasaman Ghadar·Subrata Goswami·Neha Gupta·Kevin Harms·Väinö Hatanpää·Brian Holland·Carissa Holohan·Brian Homerding·Khalid Hossain·Xue Hu·Louise Huot·Huda Ibeid·Joseph A. Insley·Sai Jayanthi·Hong Jiang·Wei Jiang·Xiao-Yong Jin·Jeongnim Kim·Christopher Knight·Panagiotis Kourdis·Kalyan Kumaran·JaeHyuk Kwack·Janghaeng Lee·Ti Leggett·Ben Lenard·Chris Lewis·Nevin Liber·Johann Lombardi·Raymond M. Loy·Ye Luo·Bethany Lusch·Nilakantan Mahadevan·Beth Markey·Victor A. Mateevitsi·Gordon McPheeters·Ryan Milner·Jerome Mitchell·Vitali A. Morozov·Servesh Muralidharan·Tom Musta·Mrigendra Nagar·Vikram Narayana·Marieme Ngom·Anthony-Trung Nguyen·Nathan Nichols·Aditya Nishtala·James C. Osborn·Michael E. Papka·Scott Parker·Saumil S. Patel·Julia Piotrowska·Adrian C. Pope·Sucheta Raghunanda·Esteban Rangel·Paul M. Rich·Katherine M. Riley·Silvio Rizzi·Kris Rowe·Varuni Sastry·Adam Scovel·Filippo Simini·Haritha Siddabathuni Som·Patrick Steinbrecher·Rick Stevens·Xinmin Tian·Peter Upton·Thomas Uram·Archit K. Vasan·Álvaro Vázquez-Mayagoitia·Kaushik Velusamy
View original source ↗Read source document ↗Export metadata ↓

Abstract

Aurora is Argonne National Laboratory's pioneering Exascale supercomputer, designed to accelerate scientific discovery with cutting-edge architectural innovations. Key new technologies include the Intel(TM) Xeon(TM) Data Center GPU Max Series (code-named Sapphire Rapids) with support for High Bandwidth Memory (HBM), alongside the Intel(TM) Data Center GPU Max Series (code-named Ponte Vecchio) on each compute node. Aurora also integrates the Distributed Asynchronous Object Storage (DAOS), a novel exascale storage solution, and leverages Intel's oneAPI programming environment. This paper presents an in-depth exploration of Aurora's node architecture, the HPE Slingshot interconnect, the supporting software ecosystem, and DAOS. We provide insights into standard benchmark performance and applications readiness efforts via Aurora's Early Science Program and the Exascale Computing Project.

Explore related subjects

cs.DCcs.ARcs.CEcs.PF

Keep this discovery

BibTeXRIS

William E. Allcock, Benjamin S. Allen, James Anchell, Victor Anisimov, Thomas Applencourt, Abhishek Bagusetty, Ramesh Balakrishnan, Riccardo Balin, Solomon Bekele, Colleen Bertoni, Cyrus Blackworth, Renzo Bustamante, Kevin Canada, John Carrier, Christopher Chan-nui, Lance C. Cheney, Taylor Childers, Paul Coffman, Susan Coghlan, Tanima Dey, Michael D'Mello, Ashok Emani, Murali Emani, Kyle G. Felker, Sam Foreman, Olivier Franza, Longfei Gao, Marta García, María Garzarán, Balazs Gerofi, Yasaman Ghadar, Subrata Goswami, Neha Gupta, Kevin Harms, Väinö Hatanpää, Brian Holland, Carissa Holohan, Brian Homerding, Khalid Hossain, Xue Hu, Louise Huot, Huda Ibeid, Joseph A. Insley, Sai Jayanthi, Hong Jiang, Wei Jiang, Xiao-Yong Jin, Jeongnim Kim, Christopher Knight, Panagiotis Kourdis, Kalyan Kumaran, JaeHyuk Kwack, Janghaeng Lee, Ti Leggett, Ben Lenard, Chris Lewis, Nevin Liber, Johann Lombardi, Raymond M. Loy, Ye Luo, Bethany Lusch, Nilakantan Mahadevan, Beth Markey, Victor A. Mateevitsi, Gordon McPheeters, Ryan Milner, Jerome Mitchell, Vitali A. Morozov, Servesh Muralidharan, Tom Musta, Mrigendra Nagar, Vikram Narayana, Marieme Ngom, Anthony-Trung Nguyen, Nathan Nichols, Aditya Nishtala, James C. Osborn, Michael E. Papka, Scott Parker, Saumil S. Patel, Julia Piotrowska, Adrian C. Pope, Sucheta Raghunanda, Esteban Rangel, Paul M. Rich, Katherine M. Riley, Silvio Rizzi, Kris Rowe, Varuni Sastry, Adam Scovel, Filippo Simini, Haritha Siddabathuni Som, Patrick Steinbrecher, Rick Stevens, Xinmin Tian, Peter Upton, Thomas Uram, Archit K. Vasan, Álvaro Vázquez-Mayagoitia, Kaushik Velusamy. 2025-09-10. Aurora: Architecting Argonne's First Exascale Supercomputer for Accelerated Scientific Discovery. https://arxiv.org/abs/2509.08207

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗
arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗
arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗