Stuart Slattery
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Stuart Slattery has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
Austin Isner
ORNL
3 shared publicationsKwitae Chong
ORNL
3 shared publications- Marco-Olivier Delchini
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
3 shared publications Ryan Glasby
ORNL
3 shared publications- Samuel Temple Reeve
Oak Ridge National Laboratory
3 shared publications - Bruno Turcksin
Oak Ridge National Laboratory, Oak Ridge, Tennessee, USA
2 shared publications
Latest Publications
- Open Access
- 20 August 2026
- Published by Elsevier in SSRN Electronic Journal
Sweep-based, implicit solutions of the multidimensional BGK equation on unstructured grids
We present a nodal discontinuous Galerkin method for solving the Bhatnagar–Gross–Krook (BGK) kinetic equation on multi-dimensional, unstructured grids. The method uses implicit, sweep-based solvers and a moment-preserving projection of the Maxwellian source to enable high-order accuracy in time while avoiding restrictive time steps imposed by boundary layers and other geometry-induced features. We verify that the method is correct in the continuum limit by comparing to closed-form and high-order solutions of the Sod shock problem on 2 and 3D unstructured grids. Linear L2 stability is demonstrated for a B-stable diagonally implicit Runge-Kutta method of third order. The solver uses a hybrid parallel scheme based on spatial domain decomposition with local sweeps performed on CPU and GPU hardware. Platform-portability is demonstrated through the development of new GPU-friendly, graph-based sweep algorithms that are implemented using the Kokkos performance portability library and achieve greater than 20 times speedup on NVIDIA H100 GPUs compared to 64-core AMD EPYC 9654 CPUs. Finally, we show results on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility for a boundary value problem with 2.77 trillion phase space degrees of freedom that executed on 1536 nodes utilizing 6144 AMD MI250X GPUs.
- 20 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSweep-based, implicit solutions of the multidimensional BGK equation on unstructured grids
We present a nodal discontinuous Galerkin method for solving the Bhatnagar–Gross–Krook (BGK) kinetic equation on multi-dimensional, unstructured grids. The method uses implicit, sweep-based solvers and a moment-preserving projection of the Maxwellian source to enable high-order accuracy in time while avoiding restrictive time steps imposed by boundary layers and other geometry-induced features. We verify that the method is correct in the continuum limit by comparing to closed-form and high-order solutions of the Sod shock problem on 2 and 3D unstructured grids. Linear L2 stability is demonstrated for a B-stable diagonally implicit Runge-Kutta method of third order. The solver uses a hybrid parallel scheme based on spatial domain decomposition with local sweeps performed on CPU and GPU hardware. Platform-portability is demonstrated through the development of new GPU-friendly, graph-based sweep algorithms that are implemented using the Kokkos performance portability library and achieve greater than 20 times speedup on NVIDIA H100 GPUs compared to 64-core AMD EPYC 9654 CPUs. Finally, we show results on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility for a boundary value problem with 2.77 trillion phase space degrees of freedom that executed on 1536 nodes utilizing 6144 AMD MI250X GPUs.
- Open Access
A Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD
Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge--Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.
Open AccessA Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD
Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge--Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.
- 1 September 2024
- Published by Office of Scientific and Technical Information (OSTI)
Spinnaker Version 1.0 Theory Guide
- 1 September 2024
- Published by Office of Scientific and Technical Information (OSTI)
Spinnaker Version 1.0 Theory Guide
- Open Access
- 3 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 26 (2) , 43-52
Co-design for Particle Applications at Exascale
Co-design across the Exascale Computing Project (ECP) has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing (HPC) architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and PROGRESS/BML libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from atomistic, mesoscale, continuum, through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate separation of concerns and directly support science runs.
- 3 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 26 (2) , 43-52
Open AccessCo-design for Particle Applications at Exascale
Co-design across the Exascale Computing Project (ECP) has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing (HPC) architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and PROGRESS/BML libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from atomistic, mesoscale, continuum, through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate separation of concerns and directly support science runs.
- 1 September 2023
- Published by Office of Scientific and Technical Information (OSTI)
Spinnaker Software Quality Assurance FY23 Annual Report
The U.S. Department of Energy's Office of Scientific and Technical Information
- 1 September 2023
- Published by Office of Scientific and Technical Information (OSTI)
Spinnaker Software Quality Assurance FY23 Annual Report
The U.S. Department of Energy's Office of Scientific and Technical Information
- Open Access
- 1 May 2023
- Published by Office of Scientific and Technical Information (OSTI)
Electromagnetic Field Simulation Utilizing VERTEX
The understanding of electromagnetic fields is essential for many core applications at Oak Ridge National Laboratory (ORNL). Electromagnetic fieldsplay an important role in particle accelerators, antennas, electric motors, power grids, and are principal part of nuclear fusion. We develop a numerical solver called able to treat the Maxwell system utilizing ORNL's VERTEX framework.
- 1 May 2023
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessElectromagnetic Field Simulation Utilizing VERTEX
The understanding of electromagnetic fields is essential for many core applications at Oak Ridge National Laboratory (ORNL). Electromagnetic fieldsplay an important role in particle accelerators, antennas, electric motors, power grids, and are principal part of nuclear fusion. We develop a numerical solver called able to treat the Maxwell system utilizing ORNL's VERTEX framework.
- Open Access
- 16 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 42 (2) , 1-21
A Sparse Distributed Gigascale Resolution Material Point Method
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.
- 16 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 42 (2) , 1-21
Open AccessA Sparse Distributed Gigascale Resolution Material Point Method
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.
- Open Access
- 10 April 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (72) , 4115
Cabana: A Performance Portable Library for Particle-Based Simulations
- 10 April 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (72) , 4115
Open AccessCabana: A Performance Portable Library for Particle-Based Simulations
- Open Access
ArborX: A Performance Portable Geometric Search Library
Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e. being able to efficiently utilize a variety of hardware architectures. In this paper, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. We examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs, and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.
Open AccessArborX: A Performance Portable Geometric Search Library
Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e. being able to efficiently utilize a variety of hardware architectures. In this paper, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. We examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs, and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.
- 1 February 2016
- Published by Elsevier in Journal of Computational Physics
- Vol. 307, 164-188
Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism
- 1 February 2016
- Published by Elsevier in Journal of Computational Physics
- Vol. 307, 164-188
Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism