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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Integration of scanning probe microscope with high-performance computing: Fixed-policy and reward-driven workflows implementation

The rapid development of computation power and machine learning algorithms has paved the way for automating scientific discovery with a scanning probe microscope (SPM). The key elements toward operationalization of the automated SPM are the interface to enable SPM control from Python codes, availability of high computing power, and development of workflows for scientific discovery. Here, we build a Python interface library that enables controlling an SPM from either a local computer or a remote high-performance computer, which satisfies the high computation power need of machine learning algorithms in autonomous workflows. We further introduce a general platform to abstract the operations of SPM in scientific discovery into fixed-policy or reward-driven workflows. Furthermore, our work provides a full infrastructure to build automated SPM workflows for both routine operations and autonomous scientific discovery with machine learning.

47 OTHER INSTRUMENTATION↗
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 OSTI2021

SBIR Phase I Final Report, TACO: Distributed and Heterogeneous Sparse Compiler

Tensor algebra is a powerful tool for computing, but writing optimized codes that operate on sparse tensors can be very complex. This project enables a Tensor Algebra Compiler (TACO) that simplifies this task from man-years to man-days and extends TACO to support complex and large distributed systems. This report details the hypotheses, approaches used, and findings in this project.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Nuclear Computational Low Energy Initiative (NUCLEI)

The NUCLEI project, as defined by the scope of work, developed, implemented and run codes for large-scale computations of many topics in low-energy nuclear physics. Physics studied include the properties of nuclei and nuclear decays, nuclear structure and reactions, and the properties of nuclear matter. The computational techniques used include Quantum Monte Carlo, Configuration Interaction, Coupled Cluster, and Density Functional methods. The research program emphasized areas of high interest to current and possible future DOE nuclear physics facilities, including ATLAS and FRIB (nuclear structure and reactions, and nuclear astrophysics), TJNAF (neutron distributions in nuclei, few body systems, and electroweak processes), NIF (thermonuclear reactions), MAJORANA and FNPB (neutrinoless double-beta decay and physics beyond the Standard Model), and LANSCE (fission studies).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

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

Source Discretization Near Curvilinear Mesh Refinements in One Dimeions (Summer Internship Final Report)

Lawrence Livermore National Lab developed the seismic wave code SW4 for earthquake simulations, and has recently added the ability to specify mesh-refinement interfaces in the curvilinear mesh. The primary purpose of this is to allow for high resolution near the surface, with relatively fewer total points in the mesh leading to shorter computation time. Presently, the code does not allow for point-source forcing terms (commonly used in seismic simulations) to be located near these curvilinear mesh refinement interfaces. The goal of this internship was to investigate the discretization of point-source forcing terms in the seismic wave equation when the sources are located near the interfaces between two curvilinear meshes. Ultimately this will be incorporated into SW4 to allow for more realistic simulations to be carried out in this faster implementation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Code-verification techniques for the method-of-moments implementation of the combined-field integral equation

Code verification plays an important role in establishing the credibility of computational simulations by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, the numerical solution to integral equations incurs multiple interacting sources of numerical error, as well as other challenges, which render traditional code-verification approaches ineffective. In this paper, we provide approaches to separately measure the numerical errors arising from these different error sources for the method-of-moments implementation of the combined-field integral equation. Here, we demonstrate the effectiveness of these approaches for cases with and without coding errors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On a Simplified Approach to Achieve Parallel Performance and Portability Across CPU and GPU Architectures

This paper presents software advances to easily exploit computer architectures consisting of a multi-core CPU and CPU+GPU to accelerate diverse types of high-performance computing (HPC) applications using a single code implementation. The paper describes and demonstrates the performance of the open-source C++ matrix and array (MATAR) library that uniquely offers: (1) a straightforward syntax for programming productivity, (2) usable data structures for data-oriented programming (DOP) for performance, and (3) a simple interface to the open-source C++ Kokkos library for portability and memory management across CPUs and GPUs. The portability across architectures with a single code implementation is achieved by automatically switching between diverse fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. The MATAR library solves many longstanding challenges associated with easily writing software that can run in parallel on any computer architecture. This work benefits projects seeking to write new C++ codes while also addressing the challenges of quickly making existing Fortran codes performant and portable over modern computer architectures with minimal syntactical changes from Fortran to C++. We demonstrate the feasibility of readily writing new C++ codes and modernizing existing codes with MATAR to be performant, parallel, and portable across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Celeritas: GPU-accelerated particle transport for detector simulation in High Energy Physics experiments

Within the next decade, experimental High Energy Physics (HEP) will enter a new era of scientific discovery through a set of targeted programs recommended by the Particle Physics Project Prioritization Panel (P5), including the upcoming High Luminosity Large Hadron Collider (LHC) HL-LHC upgrade and the Deep Underground Neutrino Experiment (DUNE). These efforts in the Energy and Intensity Frontiers will require an unprecedented amount of computational capacity on many fronts including Monte Carlo (MC) detector simulation. In order to alleviate this impending computational bottleneck, the Celeritas MC particle transport code is designed to leverage the new generation of heterogeneous computer architectures, including the exascale computing power of U.S. Department of Energy (DOE) Leadership Computing Facilities (LCFs), to model targeted HEP detector problems at the full fidelity of Geant4. This paper presents the planned roadmap for Celeritas, including its proposed code architecture, physics capabilities, and strategies for integrating it with existing and future experimental HEP computing workflows.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Development and Validation of Physics-Based Sub-Models of High-Pressure Supercritical Fuel Injection at Diesel Conditions Insert

The project sought to develop and validate accurate, physics-based, numerical submodels and implement them in computational fluid dynamics (CFD) software codes to enable accurate predictions of diesel sprays at pressures higher than the current systems. The combined experimental-computational effort has four main objectives: (1) acquire spatially and temporally resolved scalar measurements of fuel-oxidizer mixing in the near field of the fuel jet, (2) develop software modules to calculate thermo-physical properties of diesel surrogates and their mixtures with oxidizer of interest in real-gas operating regime, (3) integrate the real-fluid model into a commercial and an open-source CFD code to simulate fuel-air mixing in high-pressure diesel sprays, and (4) assess the robustness, accuracy, and uncertainty of the integrated CFD solvers in computing diesel sprays. Project accomplishments are consistent with the original goals of the project. Although we acquired spatially and temporally resolved scalar measurements, they were limited to refractive index difference and not to thermodynamic properties such as temperature and equivalence ratio. However, we successfully developed the theoretical background needed to acquire such measurements at diesel conditions and demonstrated the capability of the RSD for scalar measurements in a canonical turbulent jet flow replicating features of the diesel jet. Additional work will be needed to implement these procedures at high-pressure, high-temperature engine-like conditions of the CPFR. Mainly, we did not anticipate the need to find the liquid boundary and its statistical features or the state relationships between refractive index and thermodynamic properties, assuming the widely known Dale-Gladstone equation would suffice. Still, efforts devoted to these tasks were essential to fulfil the goals of the project and serves as the foundation on which many of the conclusions and key contributions of this project are based. Further assessment and application of the developed CFD codes is recommended to fully realize the benefits of this research.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Analysis of AP1000 Small-Break Loss-of-Coolant Accident Using Reactor Transient Simulator

The Westinghouse Electric Company’s Advanced Passive Reactor (AP1000) is characterized by the incorporation of passive safety systems (PSSs) designed to ensure core cooling during transient events. The assessment of PSSs requires evaluation of their performance through a combination of experiments and simulations employing various thermal-hydraulic codes. In addition, detailed evaluation of PSSs for a specific reactor system transient analysis such as loss-of-coolant-accident analysis supports understanding representative integral effects test facility development and the further evolution model development and assessment process. Developing a reactor system code is a complex and time-consuming process that requires significant engineering expertise and effort. It can take several months to even years to complete in the early stages of reactor system design and analysis. However, this process can be expedited through the use of transient simulator models for similar reactor systems, which can be used for lesson learning and training purposes. This study uses the Personal Computer Transient Analyzer (PCTRAN) code. The main advantage of PCTRAN is its ease of use and ability to run faster than real time. This study presents the results obtained for a small-break loss-of-coolant accident (SBLOCA) for two breaks using the full version (licensed) of PCTRAN. The purpose of this investigation is to evaluate the overall system behavior during the postulated SBLOCA event as well as assess the capability of the PCTRAN code to reproduce the system response during transient events. The obtained results were compared with the Westinghouse NOTRUMP system code. The PCTRAN code proved to be reliable in predicting the qualitative behavior of the system in both transient cases. As for the system response, it was found that it is contingent on the activation time of the PSSs. The differences in reactor coolant system pressure between the two codes were attributed to the critical flow model and simplification of mass and energy balance. Despite PCTRAN’s limitations, it can still provide a reasonable prediction of various reactor parameters such as pressure, mass flow rate, and void fraction during a SBLOCA scenario. It is worth noting that PCTRAN currently employs a bulk approach similar to that of the Modular Accident Analysis Program (MAAP) and MELCOR codes. However, the upcoming version of PCTRAN will include an artificial intelligence–based detection and accident prevention system, as well as different models for different reactor components. Consequently, PCTRAN has the potential to be upgraded to match the system thermal-hydraulic codes of the U.S. Nuclear Regulatory Commission and become more widely used in cybersecurity to safeguard nuclear power plants from cyberattacks.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

The strip method for shape derivatives

Abstract A major challenge in shape optimization is the coupling of finite element method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multiphysics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. The volume and boundary methods are two approaches to computing shape derivatives. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. We introduce the strip method , which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. As an added benefit, its computational complexity is comparable to that of the boundary method, that is, it is faster than the volume method. We illustrate the benefits of the strip method with numerical examples.

Hardesty, Sean↗
DOE OSTI2026

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗
DOE OSTI2020

An Efficient 1-D Thermal Stratification Model for Pool-Type Sodium-Cooled Fast Reactors

Investigating thermal stratification in the upper plenum of a sodium fast reactor (SFR) is presently a technology gap in SFR safety analysis. Understanding thermal stratification will promote safe operation of the SFR before its commercial deployment. Stratified layers of liquid sodium with a large vertical temperature gradient could be established in the upper plenum of an SFR during a down-power or a loss-of-flow transient. These stratified layers are unstable and could result in uncertainties for the core safety of an SFR. In order to predict the occurrence of the thermal stratification efficiently, we developed a one-dimensional (1-D) transport model to estimate the temperature profile of the ambient fluid in the upper plenum. This model demands much less computational effort than computational fluid dynamics (CFD) codes and provides calculations with higher fidelity than historical system-level codes. Two flow conditions were considered separately in the current study depending on if in-vessel components are presented in the upper plenum. For the condition where in-vessel components, specifically the upper internal structure, are presented, we assumed that the impinging sodium was evenly dispersed in the ambient fluid within the distance between the bottom of the in-vessel component and the jet inlet surface. For the condition where no in-vessel components are presented, we assumed that the impinging sodium was evenly dispersed in the ambient fluid within the jet length, which was determined through data-driven trainings. The newly developed 1-D model showed similar performance with the CFD model in both cases. However, due to the assumption of flat profiles of the impinging jet axial dispersion rate, nonnegligible discrepancies between the 1-D prediction and the measured data were observed.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Accelerated steady-state electrostatic particle-in-cell simulation of Langmuir probes

First-principles particle-in-cell (PIC) simulation is a powerful tool for understanding plasma behavior, but this power often comes at great computational expense. Artificially reducing the ion/electron mass ratio is a time-honored practice to reduce simulation costs. Usually, this is a severe approximation. However, for steady-state collisionless, electrostatic (Vlasov–Poisson) systems, the solution with reduced mass ratio can be scaled to the solution for the real mass ratio, with no approximation. This “scaled mass” method, which works with already-existing PIC codes, can reduce the computation time for a large class of electrostatic PIC simulations by the square root of the mass ratio. The particle distributions of the resulting steady state must be trivially rescaled to yield the true distributions, but the self-consistent electrostatic field is independent of the mass ratio. This method is equivalent to “numerical timestepping,” an approach that evolves electron and ion populations with different time steps. Numerical timestepping can be viewed as a special case of the speed-limited PIC (SLPIC) method, which is not restricted to steady-state phenomena. Although the scaled-mass approach is simplest, numerical timestepping and SLPIC more easily generalize to include other effects, such as collisions. The equivalence of these new approaches is demonstrated by applying them to simulate a cylindrical Langmuir probe in electron–argon plasma, speeding up simulation by two orders of magnitude. Methods such as SLPIC can therefore play an invaluable role in interpreting probe measurements by including geometric effects, collisions, secondary emission, and non-Maxwellian distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Investigation into Scalable and Detection-Enhanced Satellite Conjunction Assessment

Imaging opportunities (viewable conjunctions) of Resident Space Objects (RSOs) by satellites are not continuously discovered. We propose to continuously produce and report viewable conjunctions among objects in orbit. Viewable conjunctions are events in space and time when a satellite may favorably view a Resident Space Object (RSO). Favorability is defined by a set of constraints, e.g., solar illumination, distance between observer and target, orbital location for viewable event. Computing viewable conjunctions requires calculation of orbital propagation while considering constraints based on the state vectors of position, velocity, with covariance for both satellite and RSO. We propose two parallel lanes of effort: acceleration and research. The objective of acceleration is to avoid missed opportunities and reduce latency for satellite maneuver requests through continuous prediction and reporting of viewable conjunctions. The effort will begin by deploying currently available software on dedicated systems and continue with optimizing the code for high performance computing hardware. The research lane aims to expand RSO inspection and modeling capabilities. Among our current research ideas are spectral characterization of RSO materials and planning multiple observations to recover RSO 3D form. Computing resources at Oak Ridge National Laboratory (ORNL) are available for the acceleration work. Laika, Maxar conjunction prediction dashboard software, and Bluesim, Maxar orbital propagation software, are expected to be the first software in the acceleration lane. Laike and Bluesim are to be provided by the sponsor, and output will be made accessible through its dashboard. Deliverables will follow a gated schedule to the sponsor. ORNL will provide progressively more robust viewable conjunction assessments from both modelled and actual ephemerides.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction (QEC) for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy, poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities, fault-tolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors.

74 ATOMIC AND MOLECULAR PHYSICS↗