Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance portable”

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 397 records · Page 22

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗

Accelerated application development: The ORNL Titan experience

The use of computational accelerators such as NVIDIA GPUs and Intel Xeon Phi processors is now widespread in the high performance computing community, with many applications delivering impressive performance gains. However, programming these systems for high performance, performance portability and software maintainability has been a challenge. In this paper we discuss experiences porting applications to the Titan system. Titan, which began planning in 2009 and was deployed for general use in 2013, was the first multi-petaflop system based on accelerator hardware. To ready applications for accelerated computing, a preparedness effort was undertaken prior to delivery of Titan. In this paper we report experiences and lessons learned from this process and describe how users are currently making use of computational accelerators on Titan.

97 MATHEMATICS AND COMPUTING↗

Developments in Performance and Portability for MadGraph5_aMC@NLO

Event generators simulate particle interactions using Monte Carlo techniques, providing the primary connection between experiment and theory in experimental high energy physics. These software packages, which are the first step in the simulation worflow of collider experiments, represent approximately 5 to 20% of the annual WLCG usage for the ATLAS and CMS experiments. With computing architectures becoming more heterogeneous, it is important to ensure that these key software frameworks can be run on future systems, large and small. In this contribution, recent progress on porting and speeding up the Madgraph5_aMC@NLO event generator on hybrid architectures, i.e. CPU with GPU accelerators, is discussed. The main focus of this work has been in the calculation of scattering amplitudes and "matrix elements", which is the computational bottleneck of an event generation application. For physics processes limited to QCD leading order, the code generation toolkit has been expanded to produce matrix element calculations using C++ vector instructions on CPUs and using CUDA for NVidia GPUs, as well as using Alpaka, Kokkos and SYCL for multiple CPU and GPU architectures. Performance is reported in terms of matrix element calculations per time on NVidia, Intel, and AMD devices. The status and outlook for the integration of this work into a production release usable by the LHC experiments, with the same functionalities and very similar user interfaces as the current Fortran version, is also described.

Valassi, Andrea↗

Constructing Highly Porous Thermoelectric Monoliths with High-Performance and Improved Portability from Solution-Synthesized Shape-Controlled Nanocrystals

Thermoelectricity offers a viable and reliable solution to convert waste heat into electricity. To enhance the performance and portability of thermoelectric materials, the crystal grain and pore structure should be simultaneously manipulated to achieve high electrical conductivity (σ), low thermal conductivity (κ), high figure of merit (zT), and low relative density. However, they cannot be synchronously realized using nanocrystals with uncontrolled domain size and shape as building blocks. Here, we employ solution-synthesized PbS nanocrystals with large grain size, controllable shape and tunable spatial packing to realize the aforementioned structural tuning. In this work, the as-sintered highly porous and well crystalline monolith exhibits high σ, low κ, high zT (1.06 at 838 K) and low relative density (82%). The phonon transport is studied by density functional theory highlighting the crucial role of phonon–pore scattering in reducing κ to enhance zT. Our strategy may benefit thermoelectrics and shed light on other technical fields such as catalysis, gas sensing, photovoltaics, and so forth.

nanocrystal↗

Entity—Hardware-agnostic Particle-in-cell Code for Plasma Astrophysics. I. Curvilinear Special Relativistic Module

Entity is a new-generation, fully open-source particle-in-cell (PIC) code developed to overcome key limitations in astrophysical plasma modeling, particularly the extreme separation of scales and the performance challenges associated with evolving, GPU-centric computing infrastructures. It achieves hardware-agnostic performance portability across various GPU and CPU architectures using the Kokkos library. Crucially, Entity maintains a high standard for usability, clarity, and customizability, offering a robust and easy-to-use framework for developing new algorithms and grid geometries, which allows extensive control without requiring edits to the core source code. This paper details the core general-coordinate special relativistic module. Entity is the first PIC code designed to solve the Vlasov–Maxwell system in general coordinates, enabling a coordinate-agnostic framework that provides the foundational structure for straightforward extension to arbitrary coordinate geometries. The core methodology achieves numerical stability by solving particle equations of motion in the global orthonormal Cartesian basis, despite using generalized coordinates like Cartesian, axisymmetric spherical, and quasi-spherical grids. Charge conservation is ensured via a specialized current deposition technique using conformal currents. The code exhibits robust scalability and performance portability on major GPU platforms (AMD MI250X, NVIDIA A100, and Intel Max Series), with the 3D particle pusher and the current deposition operating efficiently at about 2 ns per particle per time step. Functionality is validated through a comprehensive suite of standard Cartesian plasma tests and the accurate modeling of relativistic magnetospheres in curvilinear axisymmetric geometries.

Hakobyan, Hayk [Flatiron Institute, New York, NY (↗

Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures

Sparse matrix-matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this work, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗

Evaluating the performance of portable air filter walls for the James Webb Space Telescope launch campaign

The James Webb Space Telescope (JWST) launched from the Centre Spatial Guyanais (CSG) in December 2021. JWST’s requirements permitted processing in International Organization for Standardization (ISO) Class 7 or better facilities, but CSG was only equipped with ISO Class 8 facilities. To temporarily upgrade the air cleanliness in the Payload Processing Facility, Fueling Hall, and Final Assembly Building Encapsulation Hall, NASA provided two portable High Efficiency Particulate Air (HEPA) and carbon filter walls that were used in each location. The walls were comprised of stacks of two modules high and arranged in push-push configurations as shown to be most effective via Computational Fluid Dynamics simulations of expected floor layouts in each facility. After delivery to NASA’s Goddard Space Flight Center in 2020, the walls underwent initial verification measurements inside a cleanroom and validation testing in an uncontrolled area to quantify their improvement of air cleanliness and particle and molecular fallout. Validation testing showed improvements of 83-99% for airborne particle counts, 79-91% for particle fallout, and 50-90% for molecular fallout. The particle improvements were applied to the contamination budget analysis that tracked current and predicted future cleanliness against End-of-Life requirements for JWST’s critical surfaces. At CSG, the walls successfully maintained an ISO Class 7 environment or better within their envelope in each location, despite their presence in ISO Class 8 facilities with dense integration operations.

HEPA, Contamination Control, Filtration↗

Evaluating the Performance of Portable Air Filter Walls for the James Webb Space Telescope Launch Campaign

The James Webb Space Telescope (JWST) launched from the Centre Spatial Guyanais (CSG) in December 2021. JWST’s requirements permitted processing in International Organization for Standardization (ISO) Class 7 or better facilities, but CSG was only equipped with ISO Class 8 facilities. To temporarily upgrade the air cleanliness in the Payload Processing Facility, Fueling Hall, and Final Assembly Building Encapsulation Hall, NASA provided two portable High Efficiency Particulate Air (HEPA) and carbon filter walls that were used in each location. The walls were comprised of stacks of two modules high and arranged in push-push configurations as shown to be most effective via Computational Fluid Dynamics simulations of expected floor layouts in each facility. After delivery to NASA’s Goddard Space Flight Center in 2020, the walls underwent initial verification measurements inside a cleanroom and validation testing in an uncontrolled area to quantify their improvement of air cleanliness and particle and molecular fallout. Validation testing showed improvements of 83-99% for airborne particle counts, 79-91% for particle fallout, and 50-90% for molecular fallout. The particle improvements were applied to the contamination budget analysis that tracked current and predicted future cleanliness against End-of-Life requirements for JWST’s critical surfaces. At CSG, the walls successfully maintained an ISO Class 7 environment or better within their envelope in each location, despite their presence in ISO Class 8 facilities with dense integration operations.

HEPA, Contamination Control, Filtration↗

Adaptable Metadata Rich IO Methods for Portable High Performance IO

Since IO performance on HPC machines strongly depends on machine characteristics and configuration, it is important to carefully tune IO libraries and make good use of appropriate library APIs. For instance, on current petascale machines, independent IO tends to outperform collective IO, in part due to bottlenecks at the metadata server. The problem is exacerbated by scaling issues, since each IO library scales differently on each machine, and typically, operates efficiently to different levels of scaling on different machines. With scientific codes being run on a variety of HPC resources, efficient code execution requires us to address three important issues: (1) end users should be able to select the most efficient IO methods for their codes, with minimal effort in terms of code updates or alterations; (2) such performance-driven choices should not prevent data from being stored in the desired file formats, since those are crucial for later data analysis; and (3) it is important to have efficient ways of identifying and selecting certain data for analysis, to help end users cope with the flood of data produced by high end codes. This paper employs ADIOS, the ADaptable IO System, as an IO API to address (1)-(3) above. Concerning (1), ADIOS makes it possible to independently select the IO methods being used by each grouping of data in an application, so that end users can use those IO methods that exhibit best performance based on both IO patterns and the underlying hardware. In this paper, we also use this facility of ADIOS to experimentally evaluate on petascale machines alternative methods for high performance IO. Specific examples studied include methods that use strong file consistency vs. delayed parallel data consistency, as that provided by MPI-IO or POSIX IO. Concerning (2), to avoid linking IO methods to specific file formats and attain high IO performance, ADIOS introduces an efficient intermediate file format, termed BP, which can be converted, at small cost, to the standard file formats used by analysis tools, such as NetCDF and HDF-5. Concerning (3), associated with BP are efficient methods for data characterization, which compute attributes that can be used to identify data sets without having to inspect or analyze the entire data contents of large files.

97 MATHEMATICS AND COMPUTING↗