Search NASASearch

SEARCH · Search NASA

Results for “performance portability”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

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.

Endeve, Eirik [ORNL] (ORCID:0000000312519507)

Injection Locking of Gigahertz‐Frequency Surface Acoustic Wave Phononic Crystal Oscillator

Low-noise gigahertz (GHz) frequency sources are essential for applications in signal processing, sensing, and telecommunications. Surface acoustic wave (SAW) resonator-based oscillators offer compact form factors and low-phase noise due to their short mechanical wavelengths and high-quality (Q) factors. However, their small footprint makes them vulnerable to environmental variation, resulting in their poor long-term frequency stability. Injection locking is widely used to suppress frequency drift of lasers and oscillators by synchronizing to an ultra-stable reference. Here, injection locking of a 1-GHz SAW phononic-crystal oscillator is demonstrated, achieving 40-dB phase noise reduction at low offset frequencies and unperturbed low noise at large offset frequencies. Compared to a free-running SAW oscillator, which typically exhibits frequency drifts of several hundred hertz over minutes, the injection-locked oscillator reduces the frequency deviation to below 0.35 Hz. The locking range and oscillator dynamics is also investigated in the injection pulling region. The demonstrated injection-locked SAW oscillator could find applications in high-performance portable telecommunications and sensing systems.

injection locking

MFC 5.0: An exascale many-physics flow solver

Many problems of interest in engineering, medicine, and the fundamental sciences rely on high-fidelity flow simulation, making performant computational fluid dynamics solvers a mainstay of the open-source software community. Previous work MFC 3.0 was made a published, documented, and open-source solver via Bryngelson et al. Comp. Phys. Comm. (2021) with numerous physical features, numerical methods, and scalable infrastructure. MFC 5.0 is a significant update to MFC 3.0, featuring a broad set of well-established and novel physical models and numerical methods, as well as the introduction of GPU and APU (or superchip) acceleration. Here, we exhibit state-of-the-art performance and ideal scaling on the first two exascale supercomputers, OLCF Frontier and LLNL El Capitan. Combined with MFC’s single-accelerator performance, MFC achieves exascale computation in practice, and achieved the largest-to-date public CFD simulation at 200 trillion grid points as a 2025 ACM Gordon Bell Prize finalist. New physical features include the immersed boundary method, N-fluid phase change, Euler–Euler and Euler–Lagrange sub-grid bubble models, fluid-structure interaction, hypo- and hyper-elastic materials, chemically reacting flow, two-material surface tension, magnetohydrodynamics (MHD), and more. Numerical techniques now represent the current state-of-the-art, including general relaxation characteristic boundary conditions, WENO variants, Strang splitting for stiff sub-grid flow features, and low Mach number treatments. Weak scaling to tens of thousands of GPUs on OLCF Summit and Frontier and LLNL El Capitan achieves efficiencies within 5% of ideal to over 90% of their respective system sizes. Strong scaling results for a 16-times increase in device count show parallel efficiencies over 90% on OLCF Frontier. MFC’s software stack has undergone further improvements, including continuous integration, which ensures code resilience and correctness through over 300 regression tests; metaprogramming, which reduces code length while maintaining performance portability; and code generation for computing chemical reactions

Computational fluid dynamics

The Persistent Challenge of Data Locality in the Post-Exascale Era

The era of exascale computing, exemplified by systems like Frontier achieving exaflop-level performance, marks a milestone. However, the quest for sheer compute power leads to strong imbalance in system design. Hence, scaling advancements in memory, network bandwidth, and storage are also necessary and pose challenges, with a crucial need to address data locality issues. This article underscores the fundamental importance of data locality as a key abstraction for optimizing application performance. Despite notable software solutions, the growing complexity of parallelism and memory hierarchy demands performance-portable data locality solutions across diverse computing platforms. Additionally, the article revisits data locality aspects, covering hardware considerations, application perspectives, software stack abstractions, and tool support. It concludes with insights into data locality challenges and opportunities, emphasizing the ongoing significance of collaborative research for progress in this critical issue.

Unat, Didem [Koc University, Istanbul (Turkey)] (O

The ArborX Library: Version 2.0

This article provides an overview of the 2.0 release of the ArborX library, a performance portable geometric search library based on Kokkos. We describe the major changes in ArborX 2.0 including a new interface for the library to support a wider range of user problems, new search data structures (brute force and distributed), support for user functions to be executed on the results (callbacks), and an expanded set of the supported algorithms (ray tracing and clustering).

GPU

eagles-project/haero

A toolbox for constructing performance portable aerosol packages

Johnson, Jeffrey N. [Cohere Consulting LLC]

LAPIS: Linear Algebra Performance for Intermediate Subprograms

SAND2025-11594O LAPIS (Linear Algebra Performance for Intermediate Subprograms) is a compiler infrastructure for linear algebra that targets both high productivity and performance portability. It is based on the open-source MLIR package from the LLVM project. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Kelley, Brian

Flash-X Recipe Tools

SF-24-102 A code generation tool for Flash-X to support their performance portability using a domain-specific runtime library.

Lee, Youngjun

hymera

Hymera is a performance portable multiscale simulation framework based on parthenon and Kokkos, that designed to push relativistic particles, governed by slowly varying, quasi static background fields

Edelmann, Philipp [@LANL]

High-performance finite elements with MFEM

The MFEM (Modular Finite Element Methods) library is a high-performance C++ library for finite element discretizations. MFEM supports numerous types of finite element methods and is the discretization engine powering many computational physics and engineering applications across a number of domains. Furthermore, this paper describes some of the recent research and development in MFEM, focusing on performance portability across leadership-class supercomputing facilities, including exascale supercomputers, as well as new capabilities and functionality, enabling a wider range of applications. Much of this work was undertaken as part of the Department of Energy’s Exascale Computing Project (ECP) in collaboration with the Center for Efficient Exascale Discretizations (CEED).

97 MATHEMATICS AND COMPUTING

Time-temperature history and input files for ExaCA v2.0 scaling, performance, and demonstration simulations

The files in this data repository are used in various sections of the manuscript "ExaCA v2.0: A versatile, scalable, and performance portable cellular automata application for additive manufacturing solidification" by Rolchigo et al. (DOI: 10.1016/j.commatsci.2025.113734). The README file references dataset numbers as given in the manuscript's Table 2, as well as the manuscript's relevant subsections.

36 MATERIALS SCIENCE

Twelve turbine wind farm simulation with AMR-Wind

This dataset contains simulation data of a twelve turbine wind farm simulation performed with AMR-Wind. The simulation is documented in Kuhn, M. B., Henry de Frahan, M. T., Mohan, P., Deskos, G., Churchfield, M., Cheung, L., ... & Sprague, M. (2025). AMR‐Wind: A Performance‐Portable, High‐Fidelity Flow Solver for Wind Farm Simulations. Wind Energy, 28(5), e70010 (https://doi.org/10.1002/we.70010).

17 WIND ENERGY

Fiats: Functional inference and training for surrogates

Fiats provides a platform for research on the training and deployment of neural-network surrogate models for computational science. Fiats also supports exploring, advancing, and combining functional, object-oriented, and parallel programming patterns in Fortran 2023. As such, the Fiats name has dual expansions: “Functional Inference And Training for Surrogates” or “Fortran Inference And Training for Science.” Fiats inference and training procedures are pure and therefore satisfy a language constraint imposed on procedure invocations inside Fortran’s parallel loop construct: do concurrent. Furthermore, the Fiats training procedures are built around a do concurrent parallel reduction. Several compilers can automatically parallelize do concurrent on Central Processing Units (CPUs) or Graphics Processing Units (GPUs). Fiats thus aims to achieve performance portability through standard language mechanisms.

Rouson, Damian [Lawrence Berkeley National Laborat

To Interoperability And Beyond: Interoperable Types Through the Promises of C and C++ and ABI Abuse [Slides]

This presentation presents a technique that allows passing of Fortran nested-type hierarchies interoperably to C++. The technique is motivated by the Eulerian Application Project’s need to port code from Fortran to C++ to utilize the Kokkos performance portability library. The resulting method allows hierarchies of types to become interoperable while at the same time transforming Fortran array members of the original Fortran type into Kokkos::Views in the resulting C++ type.

97 MATHEMATICS AND COMPUTING

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING

Developing Information Power Grid Based Algorithms and Software

This exploratory study initiated our effort to understand performance modeling on parallel systems. The basic goal of performance modeling is to understand and predict the performance of a computer program or set of programs on a computer system. Performance modeling has numerous applications, including evaluation of algorithms, optimization of code implementations, parallel library development, comparison of system architectures, parallel system design, and procurement of new systems. Our work lays the basis for the construction of parallel libraries that allow for the reconstruction of application codes on several distinct architectures so as to assure performance portability. Following our strategy, once the requirements of applications are well understood, one can then construct a library in a layered fashion. The top level of this library will consist of architecture-independent geometric, numerical, and symbolic algorithms that are needed by the sample of applications. These routines should be written in a language that is portable across the targeted architectures.

Dongarra, Jack

Comparison of Knee and Ankle Dynamometry between NASA's X1 Exoskeleton and Biodex System 4

Pre- and post-flight dynamometry is performed on International Space Station crewmembers to characterize microgravity-induced strength changes. Strength is not assessed in flight due to hardware limitations and there is poor understanding of the time course of in-flight changes. PURPOSE: To assess the reliability of a prototype dynamometer, the X1 Exoskeleton (EXO) and its agreement with a Biodex System 4 (BIO). METHODS: Eight subjects (4 M/4 F) completed 2 counterbalanced testing sessions of knee extension/flexion (KE/KF), 1 with BIO and 1 with EXO, with repeated measures within each session in normal gravity. Test-retest reliability (test 1 and 2) and device agreement (BIO vs. EXO) were evaluated. Later, to assess device agreement for ankle plantarflexion (PF), 10 subjects (4 M/6 F) completed 3 test conditions (BIO, EXO, and BIOEXO); BIOEXO was a hybrid condition comprised of the Biodex dynamometer motor and the X1 footplate and ankle frame. Ankle comparisons were: BIO vs. BIOEXO (footplate differences), BIOEXO vs. EXO (motor differences), and BIO vs. EXO (all differences). Reliability for KE/KF was determined by intraclass correlation (ICC). Device agreement was assessed with: 1) repeated measures ANOVA, 2) a measure of concordance (rho), and 3) average difference. RESULTS: ICCs for KE/KF were 0.99 for BIO and 0.96 to 0.99 for EXO. Agreement was high for KE (concordance: 0.86 to 0.95; average differences: -7 to +9 Nm) and low to moderate for KF (concordance: 0.64 to 0.78; average differences: -4 to -29 Nm, P<0.05). BIO vs. BIOEXO PF concordance ranged from 0.89 to 0.92 and mean differences ranged from -9 to +3 Nm (BIO < BIOEXO). BIOEXO vs. EXO PF concordance ranged from 0.73 to 0.80 while mean differences were -18 to -36 Nm (BIOEXO < EXO, P<0.05). PF concordance for BIO vs. EXO was slightly lower (0.61 to 0.84) and mean differences were greater (-27 to -33 Nm; BIO < EXO, P<0.05). CONCLUSION: BIO and EXO were similarly reliable for KE and KF. KE measures produced high agreement between devices; KF did not. For ankle PF, torque differences due to the two footplates were small. However, the X1 motor reports greater torques than the Biodex motor during PF. This first prototype provides proof of concept for a reliable, robotic-based exoskeleton to perform portable dynamometry for large muscle groups of the lower body.

English, K. L.

autoGEMM: Pushing the Limits of Irregular Matrix Multiplication on Arm Architectures

This paper presents an open-source library that pushes the limits of performance portability for irregular General Matrix Multiplication (GEMM) on the widely-used Arm architectures. Our library, autoGEMM, is designed to support a wide range of Arm processors: from edge devices to HPC-grade CPUs. autoGEMM generates optimized kernels for various hardware configurations by auto-combining fragments of autogenerated micro-kernels that employ hand-written optimizations to maximize computational efficiency. We optimize the kernel pipeline by tuning the register reuse and the data load/store overlapping. In addition, we use a dynamic tiling scheme to generate balanced tile shapes. Finally, we position autoGEMM on top of the TVM framework where our dynamic tiling scheme prunes the search space for TVM to identify the optimal combination of parameters for code optimization. Evaluations on five different classes of Arm chips demonstrate the advantages of autoGEMM. For small matrices, autoGEMM achieves 98% of peak and up to 2.0x speedup over state-of-the-art libraries such as LIBXSMM and LibShalom. For irregular matrices (i.e. tall skinny and long rectangles), autoGEMM is 1.3-2.0x faster than widely-used libraries such as OpenBLAS and Eigen. autoGEMM is publicly available at: https://github.com/wudu98/autoGEMM.

Wu, Du