SEARCH · Engineering Papers

Results for “hardware algorithms”

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.

SourceResearch connectionFrom yearThrough year

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

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Frequency Response Analysis to Monitor and Identify Changes in the Impedance of a Photovoltaic Panel Measured Online using a Power Optimizer

Photovoltaic (PV) cells are generally modeled as a current source due to photocurrent, p-n junction diodes with parasitic resistance, capacitance, and inductance. This paper proposes online frequency response analysis (FRA) to measure the impedance of a PV panel using an existing panel-level power optimizer in a PV system. The algorithm will actively perturb a small signal into a 300 W rooftop PV panel and compute its small signal impedance. The technology discussed is easy to incorporate, requires no additional hardware, doesn't alter the stability of the system, and is implemented at a steady-state point. The power optimizer initially stabilizes at an operating point and then perturbs the PV current via FRA and computes PV panel impedance. The relative standard deviation test conducted indoors under 300 W/m 2 illumination on a PV panel shows a less than 5% error rate in PV panel impedance magnitude and phase is measured using a power optimizer.

14 SOLAR ENERGY↗

DOE OSTI2021

Materials challenges and opportunities for quantum computing hardware

Combatting noise on the platform The potential of quantum computers to solve problems that are intractable for classical computers has driven advances in hardware fabrication. In practice, the main challenge in realizing quantum computers is that general, many-particle quantum states are highly sensitive to noise, which inevitably causes errors in quantum algorithms. Some noise sources are inherent to the current materials platforms. de Leon et al. review some of the materials challenges for five platforms for quantum computers and propose directions for their solution. Science , this issue p. eabb2823

Science & Technology - Other Topics↗

DOE OSTI2024

MemFriend: Understanding Memory Performance with Spatial-Temporal Affinity

In HPC applications, memory access behavior is one of the main factors affecting performance. Improving an application’s memory access behavior involves optimizing data layout and/or restructuring code, and requires studying spatial-temporal data locality. Existing data locality analyses focus on single-location metrics and are restricted to evaluating temporal locality. We introduce spatial-temporal affinity metrics that quantify temporal access proximity, forward access correlation, and nearby access correlation between pairs of memory locations. We describe methods for distinguishing between potential vs. realized affinity and for reasoning about affinity at multiple resolutions (3D, 2D, 1D). Finally, we construct spatial-temporal affinity signatures that classify memory behavior and that be used to reason about changes in software (data relayout, code refactoring) or hardware (caching, prefetching). We describe methods for signature visualization, interpretation, and quantitative comparison of signatures. We evaluate our methodology using applications with variants that contrast data structures, data layouts and algorithms. We show that spatial-temporal affinity analysis provides novel insights and enables predictive reasoning about application performance when contrasted with reuse distance analysis.

Suriyakumar, Yasodhadevi↗

DOE OSTI2022

Processing Particle Data Flows with SmartNICs

Many distributed applications implement complex data flows and need a flexible mechanism for routing data between producers and consumers. Recent advances in programmable network interface cards, or SmartNICs, represent an opportunity to offload data-flow tasks into the network fabric, thereby freeing the hosts to perform other work. System architects in this space face multiple questions about the best way to leverage SmartNICs as processing elements in data flows. In this paper, we advocate the use of Apache Arrow as a foundation for implementing data-flow tasks on SmartNICs. We report on our experiences adapting a partitioning algorithm for particle data to Apache Arrow and measure the on-card processing performance for the BlueField-2 SmartNIC. Our experiments confirm that the BlueField-2’s (de)compression hardware can have a significant impact on in-transit workflows where data must be unpacked, processed, and repacked.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗

DOE OSTI2022

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Accurate Consensus-based Distributed Averaging with Variable Time Delay in Support of Distributed Secondary Control Algorithms

We report that distributed secondary control has been widely used in hierarchical control structures, where multiple distributed generators (DGs) need to coordinate to regulate system voltage and frequency. In these systems, consensus algorithms determine the average of a group of dynamic states (e.g. voltages measured by a group of DGs). To be useful, consensus algorithms must be computationally efficient, stable and accurate. In practice, numerous practical implementation challenges significantly affect the consensus equilibrium. In this paper, we quantify the accuracy deviations of the distributed average observer algorithms proposed in the literature to demonstrate the problems with the state-of-the-art distributed averaging techniques. A novel approach is proposed that achieves accurate average tracking in the presence of time-varying communication delays among agents. In our implementation, time synchronization of all distributed controllers is enabled by a novel software platform, called Resilient Information Architecture Platform for the Smart Grid (RIAPS). The proposed distributed average observer is implemented on hardware controllers and its effectiveness is validated in a controller hardware-in-the-loop testbed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Quantum Computer-Aided Design: Digital Quantum Simulation of Quantum Processors

With the increasing size of quantum processors, submodules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design primitive and parameter choice in time-consuming coordination between design, fabrication, and experimental validation. Here we show how one can design and test the performance of next-generation quantum hardware—by using existing quantum computers. Focusing on superconducting transmon processors as a prominent hardware platform, we compute the static and dynamic properties of individual and coupled transmons. We show how the energy spectra of transmons can be obtained by variational hybrid quantum-classical algorithms that are well suited for near-term noisy quantum computers. In addition, single- and two-qubit gate simulations are demonstrated via Suzuki-Trotter decomposition. Our methods pave a promising way towards designing candidate quantum processors when the demands of calculating submodule properties exceed the capabilities of classical computing resources.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗

DOE OSTI2023

Understanding Impacts of Frequency Calculations on Underfrequency Load Shedding

Power system fundamental frequency-dependent protection decisions and control decisions are increasingly common in the distribution system space. Understanding the algorithms used in frequency measurements is critical to understanding the decisions made by the many intelligent electronic devices in the power system. These decisions are critically important for reliability analysis for interconnected power systems as they bear directly on resource planning to mitigate under-frequency conditions that would result in under-frequency load shedding (UFLS). This work aims to improve the understanding of frequency measurement algorithms, evaluate the intelligent electronic devices that use frequency measurements for decision making, and understand the algorithms' direct impact on frequency related decision making. First, this work presents background information on the use of frequency measurements in protection logic, specifically UFLS. Second, the paper presents a relay hardware evaluation test bed used to detect and protect systems from under-frequency events. Finally, the paper presents the dynamic events used to evaluate commercially available, off-the-shelf relay equipment and the results from the relay evaluation.

COMTRADE↗

DOE OSTI2024

FiberFlex: Real-time FPGA-based Intelligent and Distributed Fiber Sensor System for Pedestrian Recognition

In recent years, security monitoring of public places and critical infrastructure has heavily relied on the widespread use of cameras, raising concerns about personal privacy violations. To balance the need for effective security monitoring with the protection of personal privacy, we explore the potential of optical fiber sensors for this application. This article proposes FiberFlex, an intelligent and distributed fiber sensor system. Ultizing Field Programmable Gate Arrays (FPGA) high-level synthesis (HLS) acceleration, FiberFlex offers real-time pedestrian detection by co-designing the entire pipeline of optical signal acquisition, processing, and recognition networks based on the principles of optical fiber sensing. As a promising alternative to traditional camera-based monitoring systems, FiberFlex achieves pedestrian detection by analyzing the vibration patterns caused by pedestrian footsteps, enabling security monitoring while preserving individual privacy. FiberFlex comprises three modules: First , fiber-optic sensing system: A fiber-optic distributed acoustic sensing (DAS) system is built and used to measure the ground vibration waves generated by people walking. Second , algorithms: We first collect the training data by measuring the ground vibration waves, label the data, and use the data to train the neural network models to perform pedestrian recognition. Third , hardware accelerators: We use HLS tools to design hardware modules on FPGA for data collection and pre-processing and integrate them with the downstream neural network accelerators to perform in-line real-time pedestrian detection. The final detection results are sent back from FPGA to the host CPU. We implement our system FiberFlex with the in-house built DAS system and AMD/Xilinx Kintex7 FPGA KC705 board and verify the whole system using the real-world collected data. We conduct recognition tests on five test subjects of varying ages, heights, and weights in a fixed sensing area. Each subject experienced 20 real-time recognition tests using their daily walking habits, and the subjects were given adequate rest between tests. After 100 tests on five test subjects, the overall real-time recognition accuracy exceeded $88.0\%$ . The whole system uses 55 W of power, 33 W in the optical DAS system and 22 W in the FPGA. Relying on its end-to-end interdisciplinary design, FiberFlex seamlessly combines fiber-optic sensors with FPGA accelerators to enable low-power real-time security monitoring without compromising privacy, making it a valuable addition to the existing security monitoring network. According to FiberFlex, more valuable research can be conducted in the future, such as fall monitoring for the elderly, migration of identification networks between different application scenarios, and improvement of anti-interference performance in more complex environments. In future perception networks, where the “eyes” are not feasible, let’s use fiber optic touch instead.

Distributed↗

DOE OSTI2021

Cloud Droplet Measurement System for the ARM Tethered Balloon System (TBS) Field Campaign Report

The Mesa Photonics' cloud droplet measurement system (CDMS) performs in situ measurement of droplet size distribution and droplet number density in clouds. These characteristics are important cloud microphysical properties that are critical input parameters for atmospheric models and are also useful for proper calibration and validation of performance of other atmospheric measurement instrumentation. This small campaign was the first project (out of two) that involved integration of the CDMS into the U.S. Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) user facility’s tethered balloon system (TBS) and its initial testing at the ARM Southern Great Plains (SGP) atmospheric observatory. The follow-up campaign (AFC07016) involved testing of the CDMS under relevant conditions at the third ARM Mobile Facility (AMF3) at Oliktok Point, Alaska and making in situ measurements in clouds. The goal of this small field campaign was to deploy the CDMS on the ARM TBS, demonstrate its integrity and compatibility with the TBS, and test the wireless telecommunication system in preparation for subsequent in-cloud measurements at ARM’s North Slope of Alaska (NSA) observatory at Utqiagvik (formerly Barrow). The specific technical objectives included: (1) Integration of the Mesa Photonics' CDMS into the ARM TBS, (2) testing of the wireless telecommunication system of the CDMS, (3) evaluating the data acquisition software and image processing algorithms especially under high-background-illumination conditions, and (4) testing the ruggedness of the instrument's optical alignment and other performance characteristics. All objectives have been successfully met. The mounting hardware was designed and built mostly at Sandia National Laboratories (SNL), which allowed reliable mounting of the CDMS on the TBS and co-locating the CDMS with other instruments. The field tests were performed by the principal investigator (PI) in collaboration with the TBS operational crew led by D. Dexheimer. The field testing demonstrated good compatibility of the CDMS with the TBS. During the TBS flights, the crew did not experience any operational issues with the CDMS. The instrument demonstrated reliable operational characteristics, including sufficient battery life and good thermal management. The wireless telecommunication system has been successfully tested at TBS flight altitudes of up to 1000 m. During all flights, the CDMS raw data were wirelessly transmitted to the ground station and processed in real time. The ruggedness of the instrument's optical alignment was evaluated by performing calibration of the CDMS (using Mesa Photonics' fixed-size monodisperse droplet generator) before and after the campaign. The calibration was stable within the instrument's measurement precision. In summary, the campaign demonstrated good compatibility of the Mesa Photonics' CDMS with the ARM TBS. The flight tests confirmed the mechanical integrity of the CDMS and stability of its optical layout, as well as reliability of the wireless telecommunication system. Successful completion of this campaign provided a solid basis for the next campaign (AFC07016, November 2020), that involved testing of the CDMS during in-cloud TBS flights at AMF3 at Oliktok Point.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

OpenCGRA: An Open-Source Unified Framework for Modeling,Testing, and Evaluating CGRAs

Coarse-grained reconfigurable arrays (CGRAs),loosely defined as arrays of functional units (e.g, adder, sub-tractor, multiplier, divider, or larger multi-operation units, butsmaller than a general-purpose core) interconnected through aNetwork-on-Chip, provide higher flexibility than domain-specificASIC accelerators while offering increased hardware efficiencywith respect to fine-grained reconfigurable devices, such as FieldProgrammable Gate Arrays (FPGAs). The fast evolving fieldsof machine learning and edge computing, which are seeing acontinuous flow of novel algorithms and larger models, makeCGRAs ideal target architectures to allow domain specializationwithout loosing too much generality. They also generally offerquicker and more effective reconfigurability than FPGAs, po-tentially allowing adaptation during actual algorithm execution,and implement a dataflow programming paradigm that adaptswell to these emerging workloads. Designing and generating aCGRA, however, still requires to define the type and number ofthe specific functional units, implement their interconnect andthe network topology, and perform its simulation and validation,given a variety of workloads of interest.In this paper, we propose OpenCGRA, a Python-based unifiedframework that integrates generation, modeling, testing and eval-uation for CGRAs. OpenCGRA is the first open-source integratedframework able to support the full top-to-bottom design flow forspecializing and implementing CGRAs: modeling at different ab-straction levels (functional level, cycle level, register-transfer level),generation, simulation, testing at different granularities (unit test-ing, integration testing, property-based testing), and characteriza-tion (area, power, and timing). OpenCGRAs will be made availableon GitHub.

CGRA, synthesis↗

DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗

DOE OSTI2024

Impurity gas detection for SNF canisters using probabilistic deep learning and acoustic sensing *

Abstract Monitoring impurity gases in spent nuclear fuel (SNF) canisters is a novel structural health monitoring approach for SNF in dry storage. The SNF canisters are sealed containers that do not facilitate visual access to the inside. Acoustic sensing can be deployed by taking advantage of the pathways unobstructed by internal hardware. Although the ultrasonic time-of-flight measurement can provide valuable information, it is limited in its ability to discern the concentration of only one impurity gas. As such, deep learning algorithms, particularly convolutional neural networks (CNNs), offer a promising solution. In this study, CNN-based probabilistic deep learning models were implemented to detect and quantify multiple impurity gases in helium. An experimental platform was established to simulate canister conditions, and ultrasonic test data were collected. The presence of argon and air in helium at concentrations ranging from 0% to 1.2% at increments of 0.05% was considered. The multi-layer perceptron, decision tree, and logistic regression classifiers achieved high accuracies when distinguishing pure helium from helium with impurities. CNN with dropout layers and CNN using maximum likelihood estimation showed a similar performance, indicating their ability to capture uncertainties. The ensemble CNN model exhibited improved predictions and the ability to balance individual gas concentration by integrating 1D- and 2D-CNN models. These findings contribute probabilistic deep learning solutions for impurity gas detection and analysis within SNF canisters, thus ensuring safe storage and management of SNFs.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

Optimization of a High Pressure Turbine Blade and Sector-Based Annular Rig Design for Supercritical CO2 Power Cycle Representative Testing

Abstract As part of the ongoing research into the design of hardware for zero emission cycles, a first-stage high-pressure turbine (HPT) blade is optimized for a 300 MWe supercritical CO2 (sCO2) power cycle using the surrogate-assisted genetic algorithm optimizer in Numeca FINE/Design three-dimensional with objectives of increasing efficiency and decreasing heat load to the blade. Supercritical CO2 property tables are constructed from NIST REFPROP data for the condensable gas simulation in FINE/Turbo. A detailed mesh sensitivity study is performed for a baseline design to identify the proper-grid refinement and efficiently allocate resources for the optimization. Seventy design variables are selected for the initial population generation. Self-organizing maps are then used to focus the design variables on the most important ones affecting the objective functions. The optimization results in approximately 3000 three-dimensional Reynolds Averaged Navier Stokes simulations of different blade shapes with increases in efficiency of up to 0.85% and decreases in heat load of 14%. Families of blade shapes are identified for experimental testing in an annular rig at the Purdue Experimental Turbine Aerothermal Laboratory. A design to adapt the annular cascade for testing optimized geometries is introduced, which features eccentric radius sectors allowing for scaled-up geometries of sCO2 optimized blade profiles to be tested at design cycle representative conditions at high Reynolds numbers in dry air. Analysis into the effects of Reynolds number, working fluid, and geometric relations are presented to prove the efficacy of the test method.

Engineering↗

DOE OSTI2020

FY20 ASC IC L2 Milestone 7180: Performance Portability of SIERRA Mechanics Applications to ATS-1 and ATS-2. Executive Summary

The overall goal of this work was to accelerate simulations supporting the nuclear deterrence (ND) mission through improved performance of key algorithms in the ASC IC Sierra multi-physics application suite. This work focused on porting and optimizing algorithms for the graphics processing units (GPU) on the second ASC advanced technology system (ATS-2), while maintaining or improving performance on commodity technology systems (CTS) and ATS-1. Furthermore, these algorithmic developments used the ASC developed Kokkos performance portability abstraction library to maintain high performance across platforms using identical code, and enable sustainable reduced-cost migration and performance optimization to emerging hardware.

97 MATHEMATICS AND COMPUTING↗