Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Coded computing”

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 1,297 records · Page 72
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A massively parallel time-domain coupled electrodynamics–micromagnetics solver

We present a high-performance coupled electrodynamics–micromagnetics solver for full physical modeling of signals in microelectronic circuitry. The overall strategy couples a finite-difference time-domain approach for Maxwell’s equations to a magnetization model described by the Landau–Lifshitz–Gilbert equation. The algorithm is implemented in the Exascale Computing Project software framework, AMReX, which provides effective scalability on manycore and GPU-based supercomputing architectures. Furthermore, the code leverages ongoing developments of the Exascale Application Code, WarpX, which is primarily being developed for plasma wakefield accelerator modeling. Our temporal coupling scheme provides second-order accuracy in space and time by combining the integration steps for the magnetic field and magnetization into an iterative sub-step that includes a trapezoidal temporal discretization for the magnetization. The performance of the algorithm is demonstrated by the excellent scaling results on NERSC multicore and GPU systems, with a significant (59×) speedup on the GPU using a node-by-node comparison. We demonstrate the utility of our code by performing simulations of an electromagnetic waveguide and a magnetically tunable filter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

ComPort: Rigorous Testing Methods to Safeguard Software Porting (Final UW Report)

This report summarizes the University of Washington’s contributions to the ComPort project, Rigorous Testing Methods to Safeguard Software Porting, funded under the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research (ASCR), award number DE-SC0022081. UW’s work addressed numerics-driven correctness challenges arising in heterogeneous and rapidly evolving computing environments. Our efforts focused on developing interactive analysis tools, correctness-preserving rewriting systems, semantic-aware code-transformation infrastructure, and multi-language support for reproducible numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Evaluation of Portable Programming Models to Accelerate LArTPC Detector Simulations

The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development that requires often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

VERA Integration in the NEAMS Workbench

The Virtual Environment for Reactor Applications (VERA) is a cutting edge simulation code suite used to solve complex multiphysics problems for nuclear reactors. VERA makes use of high performance computing (HPC) systems to solve large problems that were not historically tractable. While extensive work has been put into the usability of VERA, it still takes significant effort to build reactor models, ensure their correctness, properly execute the calculations, and conduct the necessary analysis of the results. This difficulty is common for many complex codes such as VERA. As part of the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the NEAMS Workbench has been developed and maintained. The goal of the NEAMS Workbench is to provide a single interface with which to execute a wide variety of physics codes, from building the input models to analyzing the results. This document serves as a manual detailing the current integration of VERA with the NEAMS Workbench and a guide for configuring Workbench to allow remote execution of VERA.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

MONKES: a fast neoclassical code for the evaluation of monoenergetic transport coefficients in stellarator plasmas

Abstract MONKES is a new neoclassical code for the evaluation of monoenergetic transport coefficients in stellarators. By means of a convergence study and benchmarks with other codes, it is shown that MONKES is accurate and efficient. The combination of spectral discretization in spatial and velocity coordinates with block sparsity allows MONKES to compute monoenergetic coefficients at low collisionality, in a single core, in approximately one minute. MONKES is sufficiently fast to be integrated into stellarator optimization codes for direct optimization of the bootstrap current and to be included in predictive transport suites. The code and data from this paper are available at https://github.com/JavierEscoto/MONKES/ .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Technical descriptions of the experimental dynamical downscaling simulations over North America by the CAM–MPAS variable-resolution model

Abstract. Comprehensive assessment of climate datasets is important for communicating model projections and associated uncertainties to stakeholders. Uncertainties can arise not only from assumptions and biases within the model but also from external factors such as computational constraint and data processing. To understand sources of uncertainties in global variable-resolution (VR) dynamical downscaling, we produced a regional climate dataset using the Model for Prediction Across Scales (MPAS; dynamical core version 4.0) coupled to the Community Atmosphere Model (CAM; version 5.4), which we refer to as CAM–MPAS hereafter. This document provides technical details of the model configuration, simulations, computational requirements, post-processing, and data archive of the experimental CAM–MPAS downscaling data. The CAM–MPAS model is configured with VR meshes featuring higher resolutions over North America as well as quasi-uniform-resolution meshes across the globe. The dataset includes multiple uniform- (240 and 120 km) and variable-resolution (50–200, 25–100, and 12–46 km) simulations for both the present-day (1990–2010) and future (2080–2100) periods, closely following the protocol of the North American Coordinated Regional Climate Downscaling Experiment. A deviation from the protocol is the pseudo-warming experiment for the future period, using the ocean boundary conditions produced by adding the sea surface temperature and sea-ice changes from the low-resolution version of the Max Planck Institute Earth System Model (MPI-ESM-LR) in the Coupled Model Intercomparison Project Phase 5 to the present-day ocean state from a reanalysis product. Some unique aspects of global VR models are evaluated to provide background knowledge to data users and to explore good practices for modelers who use VR models for regional downscaling. In the coarse-resolution domain, strong resolution sensitivity of the hydrological cycles exists over the tropics but does not appear to affect the midlatitude circulations in the Northern Hemisphere, including the downscaling target of North America. The pseudo-warming experiment leads to similar responses of large-scale circulations to the imposed radiative and boundary forcings in the CAM–MPAS and MPI-ESM-LR models, but their climatological states in the historical period differ over various regions, including North America. Such differences are carried to the future period, suggesting the importance of the base state climatology. Within the refined domain, precipitation statistics improve with higher resolutions, and such statistical inference is verified to be negligibly influenced by horizontal remapping during post-processing. Limited (≈50 % slower) throughput of the current code is found on a recent many-core/wide-vector high-performance computing system, which limits the lengths of the 12–46 km simulations and indirectly affects sampling uncertainty. Our experience shows that global and technical aspects of the VR downscaling framework require further investigations to reduce uncertainties for regional climate projection.

58 GEOSCIENCES↗
DOE OSTI2020

GronOR: Massively Parallel and GPU-Accelerated Non-Orthogonal Configuration Interaction for Large Molecular Systems

GronOR is a program package for non-orthogonal configuration interaction calculations for an electronic wave function built in terms of anti-symmetrized products of multi-configuration molecular fragment wave functions. The two-electron integrals that have to be processed may be expressed in terms of atomic orbitals or in terms of an orbital basis determined from the molecular orbitals of the fragments. The code has been specifically designed for execution on distributed memory massively parallel and Graphics Processing Unit (GPU)-accelerated computer architectures, using an MPI+OpenACC/OpenMP programming approach. The task-based execution model used in the implementation allows for linear scaling with the number of nodes on the largest pre-exascale architectures available, provides hardware fault resiliency, and enables effective execution on systems with distinct central processing unit-only and GPU-accelerated partitions. The code interfaces with existing multi-configuration electronic structure codes that provide optimized molecular fragment orbitals, configuration interaction coefficients, and the required integrals. Algorithm and implementation details, parallel and accelerated performance benchmarks, and an analysis of the sensitivity of the accuracy of results and computational performance to thresholds used in the calculations are presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Quantum computation of nuclear observables involving linear combinations of unitary operators

Here we present the quantum computation of nuclear observables where the operators of interest are first decomposed in terms of the linear combination of unitaries. Then we utilize the Hadamard test and the linear combination of unitaries based methods to compute the expectation values. We apply these methods to calculate the electric quadrupole moment of the deuteron. The results are compared for the Jordan-Wigner transformation and Gray code encoding. We discuss the versatility of our approach that can be utilized in general to calculate several observables on a quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Hazma meets HERWIG4DM: precision gamma-ray, neutrino, and positron spectra for light dark matter

Herein we present a new open-source package, Hazma 2, that computes accurate spectra relevant for indirect dark matter searches for photon, neutrino, and positron production from vector-mediated dark matter annihilation and for spin-one dark matter decay. The tool bridges across the regimes of validity of two state of the art codes: Hazma 1, which provides an accurate description below hadronic resonances up to center-of-mass energies around 250 MeV, and Herwig4DM, which is based on vector meson dominance and measured form factors, and accurate well into the few GeV range. The applicability of the combined code extends to approximately 1.5 GeV, above which the number of final state hadrons off of which we individually compute the photon, neutrino, and positron yield grows exceedingly rapidly. We provide example branching ratios, particle spectra and conservative observational constraints from existing gamma-ray data for the well-motivated cases of decaying dark photon dark matter and vector-mediated fermionic dark matter annihilation. Finally, we compare our results to other existing codes at the boundaries of their respective ranges of applicability. Hazma 2 is freely available on GitHub athttps://github.com/LoganAMorrison/Hazma.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Hexagonal Geometries in MPACT

The MPACT code is a high-fidelity light-water reactor analysis code using whole-core pin-resolved neutron transport calculations on modern parallel-computing hardware. MPACT uses the 2D/1D method to solve 3D neutron transport problems by decomposing the problem into a stack of 2D slices, each of which is solved independently using the method of characteristics (MOC). The slices are then coupled axially using the P3 nodal expansion method (NEM-P3) for the 1D axial calculations. MPACT also employs the coarse mesh finite difference (CMFD) method to accelerate calculations. This manuscript details work supporting advanced reactor designs using hexagonal pins and hexagonal assemblies such as the VVER-1000. If performed correctly, MOC is geometry agnostic. However, MPACT previously had optimizations in place for Cartesian geometries, specifically in the modularization and current calculations. Sections 2 and 3 detail the changes made to MPACT to support MOC and CMFD calculations on hexagonal geometries. Section 4 reports results demonstrating solution consistency for problems run with and without CMFD acceleration, results demonstrating solution consistency when run in serial and parallel, and pincell results using the Monte Carlo code, McCard’s benchmark results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2024

High-Throughput Computing: Case Study of Medical Image Processing Applications

HPC is designed for large-scale simulations using monolithic codes of tightly coupled processes highly optimized to deliver decreased time to solution. Medical image processing is not a traditional field of HPC. Similar to AI applications, medical image processing parses large datasets, typically multiple times, to support a variety of studies for classification, diagnosis or monitoring purposes. The convergence of AI, HPC and Big Data encouraged more fields using image processing to transition to HPC. However, not all applications benefit from the same optimizations. In this paper we focus on high throughput medical image processing applications that analyze a huge dataset of small MRI images and that require HPC systems to decrease the time of parsing the entire dataset and not individual MRIs. We show in this research the performance of running SLANT, an image processing application for a whole brain segmentation, on large-scale systems and highlight performance limitations. We present optimizations prioritizing throughput that exhibit a 3.5x speed-up on the Summit Supercomputer that can be used as a baseline for building a high-throughput execution framework for other HPC systems.

Predescu, Maria↗
DOE OSTI2023

Evaluation of OpenAI Codex for HPC Parallel Programming Models Kernel Generation

We evaluate AI-assisted generative capabilities on fundamental numerical kernels in high-performance computing (HPC), including AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG. We test the generated kernel codes for a variety of language-supported programming models, including (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). We use the GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code as of April 2023 to generate a vast amount of implementations given simple + + prompt variants. To quantify and compare the results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. Results suggest that the OpenAI Codex outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general purpose Python can benefit from adding code keywords, while Julia prompts perform acceptably well for its mature programming models (e.g., Threads and CUDA.jl). We expect for these benchmarks to provide a point of reference for each programming model's community. Overall, understanding the convergence of large language models, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

Godoy, William↗
DOE OSTI2020

S/U Comparison Study with a Focus on USLs

Under a DOE Nuclear Criticality Safety Program (NCSP) task involving Analytical Methods, three Laboratories collaborated in a comparison of results obtained from Sensitivity/Uncertainty (S/U) packages relevant to validation of transport codes. The task involves Institut de Radioprotection et de Sûreté Nucléaire (IRSN), Los Alamos National Laboratory (LANL), and Oak Ridge National Laboratory (ORNL) comparing results of MORET 5/MACSENS V3.0, MCNP6.2/Whisper-1.1, and SCALE 6.2.3/TSUNAMI/USLSTATS respectively. All Monte Carlo transport code results utilize ENDF/B-VII.1. Four cases from the International Handbook of Evaluated Criticality Safety Benchmark Experiments (ICSBEP Handbook) were selected as application models: HEU-MET-FAST-013-001, HEU-SOL-THERM 001-008, PU-MET-FAST-022-001, and PU-SOL-THERM 001-001. Ultimately, comparison is made between Upper Subcritical Limits (USLs) obtained using each code package for each application case. Since differences exist in whether packages take into account margin of subcriticality (MOS), the USL may be computed using bias and bias uncertainty, also known as the calculational margin (CM) in ANSI/ANS 8.24. Application of portions of MOS to the USL for nuclear data uncertainty of and potential code margin is referred to as USL herein. In either case, additional MOS is considered for actual application cases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Reasoning About Computing in the Post-Moore world [Slides]

We are facing new challenges due to technology shifts and evolving mission requirements. Meeting these challenges requires careful reasoning about hardware and our applications. This is important for decisions we’re making for our codes following ATDM and our decisions about future platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improving the precision of forces in real-space pseudopotential density functional theory

The high-order finite difference real-space pseudopotential density functional theory (DFT) approach is a valuable method for large-scale, massively parallel DFT calculations. A significant challenge in the approach is the oscillating “egg-box” error introduced by aliasing associated with a coarse grid spacing. To address this issue while minimizing computational cost, we developed a finite difference interpolation (FDI) scheme [Roller et al., J. Chem. Theory Comput. 19, 3889 (2023)] as a means of exploiting the high resolution of the pseudopotential to reduce egg-box effects systematically. Here, we show an implementation of this method in the PARSEC code and examine the practical utility of the combination of FDI with additional methods for improving force precision and/or reducing its computational cost, including orbital-based forces, compensating charges (namely, adding and subtracting a judiciously chosen charge density such that the total density is unaltered), and a modified spatial domain in which the real-space grid is defined. Using selected small molecules, as well as metallic Li, as test cases, we show that a combination of all four aspects leads to a significant reduction in computational cost while retaining a high level of precision that supports accurate structures and vibrational spectra, as well as stable and accurate molecular dynamics runs.

Chemistry↗
DOE OSTI2021

ANTS

The ANTS code (Alternate Non-Linear Two-phase Solver) is based on a novel non-linear solution algorithm for the solution of the two-phase, subchannel fluid equations. It achieves its performance through decoupling of the two-phase momentum equations (axial and transverse) from the axial phasic mass and energy equations which allows for a nested non-linear iteration scheme. This enables a plane-by-plane solution which the inner iteration focuses on a reduced non-linear equation set for the primitives in phasic mass flow rate, enthalpy and void for each node edge. Single node edges are coupled as part of the outer iteration via surface mass fluxes which appear as source terms in the inner iteration scheme. The outer iteration readily accommodates two-phase flow phenomena closure relationships for subchannel mixing and void drift. A primary feature is the use of a non-staggered mesh computational mesh and steady-state iterative solver in contrast to all existing subchannel codes.

Kropaczek, David J↗
DOE OSTI2023

Efficient multi-scale representation of visual objects using a biologically plausible spike-latency code and winner-take-all inhibition

Deep neural networks have surpassed human performance in key visual challenges such as object recognition, but require a large amount of energy, computation, and memory. In contrast, spiking neural networks (SNNs) have the potential to improve both the efficiency and biological plausibility of object recognition systems. Here we present a SNN model that uses spike-latency coding and winner-take-all inhibition (WTA-I) to efficiently represent visual stimuli using multi-scale parallel processing. Mimicking neuronal response properties in early visual cortex, images were preprocessed with three different spatial frequency (SF) channels, before they were fed to a layer of spiking neurons whose synaptic weights were updated using spike-timing-dependent-plasticity. We investigate how the quality of the represented objects changes under different SF bands and WTA-I schemes. We demonstrate that a network of 200 spiking neurons tuned to three SFs can efficiently represent objects with as little as 15 spikes per neuron. Furthermore, studying how core object recognition may be implemented using biologically plausible learning rules in SNNs may not only further our understanding of the brain, but also lead to novel and efficient artificial vision systems.

59 BASIC BIOLOGICAL SCIENCES↗