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 901 records · Page 50

Benchmark Specification of Advanced Burner Test Reactor

As an effort to assess the Argonne Reactor Computation (ARC) suite of fast reactor analysis codes, a numerical benchmark problem was developed using the reference 250 MWt Advanced Burner Test Reactor (ABTR) metallic core fueled with beginning of equilibrium cycle compositions (Chang et al., 2006). Material thermal expansion at operating condition was modeled by adjusting the hexagonal pitch, axial meshes, and the fuel and structure material densities appropriately. Irradiation swelling of metal fuel was considered, and the bond sodium was displaced into the lower part of fission gas plenum.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Advancing our understanding of instabilities in high-energy-density systems through the study of benchmark datasets with advanced modeling tools

Numerous types of pulsed power driven inertial confinement fusion (ICF) and high energy density (HED) systems rely on implosion stability to achieve desired temperatures, pressures, and densities. Sandia National Laboratories Pulsed Power Sciences Center’s main ICF platform, Magnetized Liner Inertial Fusion (MagLIF), suffers from implosion instabilities which limit attainable fuel conditions and can compromise fuel confinement. This Truman Fellowship research primarily focused on computationally exploring (a) methods for improving our understanding of hydrodynamic and magnetohydrodynamic instabilities that form during cylindrical liner implosions, (b) methods for mitigating implosion instabilities, particularly those that degrade performance of MagLIF targets, and (c) novel MagLIF target designs intended to improve target performance primarily via enhanced implosion stability. Several multi-dimensional computational tools were used, including the magnetohydrodynamics code ALEGRA, the radiation-magnetohydrodynamics code HYDRA, and the magnetohydrodynamics code KRAKEN. This research succeeded in executing and analyzing simulations of automagnetizing liner implosions, shockless MagLIF implosions, dynamic screw pinch driven cylindrical liner implosions, and cylindrically convergent HED instability studies. The methods and tools explored and developed in this Truman Fellowship research have been published in several peer-reviewed journal articles and will serve as useful contributions to the fields of pulsed power science and engineering, particularly pertaining to pulsed power ICF and HED science.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal Decision Making in High-Throughput Virtual Screening Pipelines

ABSTRACT Effective selection of the potential candidates that meet certain conditions in a tremendously large search space has been one of the major concerns in many real-world applications. In addition to the nearly infinitely large search space, rigorous evaluation of a sample based on the reliable experimental or computational platform is often prohibitively expensive, making the screening problem more challenging. In such a case, constructing a high-throughput screening (HTS) pipeline that pre-sifts the samples expected to be potential candidates through the efficient earlier stages, results in a significant amount of savings in resources. However, to the best of our knowledge, despite many successful applications, no one has studied optimal pipeline design or optimal pipeline operations. In this study, we propose two optimization frameworks, applying to most (if not all) screening campaigns involving experimental or/and computational evaluations, for optimally determining the screening thresholds of an HTS pipeline. We validate the proposed frameworks on both analytic and practical scenarios. In particular, we consider the optimal computational campaign for the long non-coding RNA (lncRNA) classification as a practical example. To accomplish this, we built the high-throughput virtual screening (HTVS) pipeline for classifying the lncRNA. The simulation results demonstrate that the proposed frameworks significantly reduce the effective selection cost per potential candidate and make the HTS pipelines less sensitive to their structural variations. In addition to the validation, we provide insights on constructing a better HTS pipeline based on the simulation results.

97 MATHEMATICS AND COMPUTING↗

ORCHA: A performance portability system for extreme heterogeneity

Heterogeneity is the prevalent trend in the rapidly evolving high-performance computing (HPC) landscape in both hardware and application software. The diversity in hardware platforms, currently comprising various accelerators and a future possibility of specializable chiplets, poses a significant challenge for scientific software developers aiming to harness optimal performance across different computing platforms while maintaining the quality of solutions when their applications are simultaneously growing more complex. Code synthesis and code generation can provide mechanisms to mitigate this challenge. We have developed a divide and conquer approach where different aspects of performance are handled by different stand-alone tools that are interfaced with the application through generated code. This portability system, ORCHA, enables users to configure and orchestrate their computations among available resources on a platform by specifying a high-level recipe, thereby permitting a many-to-many paradigm where each recipe results in a different variant of the application. The core design goal is to let users decide the application’s hardware mapping and orchestration by editing only the high-level recipe—without modifying the maintained source code or binding the application to a particular runtime system. Tools in ORCHA distribution are: CG-Kit for translating the recipe into an execution graph; Milhoja to execute the graph by orchestrating data and task movement among hardware resources; and Macroprocessor that enables users to define their own code-shorthand for higher composability and easier management of code variants. Additionally, the design of ORCHA permits tools to work in a plug-and-play mode where the application can build and run without CG-Kit and Milhoja, and either tool can be swapped out for other tools with similar capabilities by modifying the code generation portion of ORCHA. In this paper, we describe the design of ORCHA and the role that code-generation plays in isolating applications from tools. We demonstrate the breadth of configurations ORCHA enables with a case study in which an application configuration is realized on three distinct hardware mappings—a GPU-centric, a CPU/GPU balanced, and a CPU/GPU concurrent layouts by using different recipes.

Lee, Youngjun↗

FAST-1.0.1 User Installation and Verification Guide

The purpose of this document is to provide the user information about the installation of FAST-1.0.1 on their computers or servers. General information about the code and supported operating systems is described in Section 1.0.1. Self-service oriented FAST-1.0.1 software licensing steps are described in Section 2.0. An installation verification test suite is provided with FAST-1.0.1 and described in Section 3.0. A convenience script for converting FRAPCON to FAST inputs is discussed in Section 4.0. FAST-1.0.1 was developed and released under a software quality assurance program based upon NQA-1-2017. FAST-1.0.1 is the latest baseline code and the result of a bug fixes to FAST-1.0 with other software and methodology developments. The installation verification test suite contains both steady state and transient Anticipated Operation Occurrences (AOOs). Capability to model accident conditions, such as Reactivity Initiated Accidents (RIAs) and Loss Of Coolant Accidents (LOCAs), are targeted for a later release of FAST. FRAPTRAN-2.0 will continue to be used for accident conditions until the release of FAST with accident condition modeling capabilities.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Demonstrating Cross-Facility Data Processing at Scale with Laue Microdiffraction

In February and April 2023 live, at-scale data processing demonstrations were conducted between the Advanced Photon Source (APS), a synchrotron light source, and the Argonne Leadership Computing Facility (ALCF). These tests were run as part of a novel beamline technique: coded aperture laue micro-diffraction. This technique requires a significant amount of compute to decode appeture patterns embedded in the detector stream. An autonomous system was able to send data to ALCF during an experiment, utilize 50 nodes of the Polaris supercomputer to process 6-12 hour scans, and return the data back to the APS within 12-15 minutes behind the detector. With scan points arriving every 72 seconds, the system kept up with the beamline, potentially enabling in-experiment analysis. The data processing system utilizes Globus infrastructure and an on-demand queue to dynamically acquire nodes on Polaris. The underlying reconstruction algorithms were parallelized via MPI and accelerated with custom CUDA kernels.

Prince, Michael↗

Binder-benchmarking

SAND2025-07593O Binder-benchmarking evaluates the speed and memory impacts of C++, Python, and Matlab code binders. As a repository, it provides a way to locally run computation-based and memory-based benchmark suites on pybind11 and nanobind-based code in a Docker image. The software runs simple-speed and memory benchmarks on primitive navigation and integration exemplar algorithms. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Walker II, Michael [Sandia National Lab. (SNL-CA),↗

Subject-specific modeling framework for particle deposition using computational fluid dynamics

Quantifying particle deposition and dose in the respiratory tract requires a physiologically realistic representation and reproducible computational workflows. However, existing modeling frameworks, such as the International Commission on Radiological Protection (ICRP) compartmental models and the Multiple Path Particle Dosimetry (MPPD) tool, lack detailed deposition profiles and subject-specific capabilities. The combination of advances in computer vision algorithms applied to the respiratory tract and Computational Fluid and Particle Dynamics (CFPD) allows high-fidelity simulations of particle behavior in anatomically accurate geometries derived from individual CT scans. The segmentation, preprocessing, and file preparation task for a CFPD simulation was often time-consuming, and no prior studies to-date have yet presented a fully automated framework. This work presents a fully automated workflow to obtain individualized particle deposition profiles in the human respiratory tract. The pipeline starts with segmenting upper and lower airway geometries using morphological and deep learning-based methods, generating three-dimensional (3D) models from CT imaging data. Next, a series of algorithms are presented to quality check and prepare the 3D geometry for a CFD or CFPD simulation. The preprocessing step includes correcting geometric artifacts, enforcing a physically consistent mesh, and automatically identifying and capping multiple outlets, which is required for CFD/CFPD simulations. These processed models are then input into open-source (OpenFOAM) or commercial (StarCCM+) CFD solvers, where flow and transient particle transport equations — including turbulence and particle–wall interactions are solved under realistic breathing conditions. Finally, the resulting particle deposition profiles can be integrated with Monte Carlo radiation transport codes and state-of-the-art computational phantoms to assess organ-specific absorbed doses in scenarios of radioactive aerosol inhalation. The presented work streamlines respiratory tract segmentation, preprocessing for CFD/CFPD simulations, and integration with dose assessment workflows, reducing manual intervention and improving access to high-fidelity, subject-specific modeling. The high precision in predicted particle deposition and dose distributions can improve personalized treatment strategies in respiratory medicine and refine dose estimates for radiation protection.

AI↗

Wind Farm Layout Optimization with Loads Considerations

The objective of this paper is to improve the annual energy production of a wind farm by optimizing the layout of a wind farm, while considering fatigue loads on turbines. In this paper, the loads are estimated using the edgewise bending moment computed using CCBlade, a steady-state blade element momentum code. The edgewise bending moment is then used to calculate fatigue damage using Miner's rule. The fatigue damage is used to constrain the layout optimization problem. We show that our method can predict blade root damage with similar trends to damage calculated with other methods, such as a complex, computationally expensive large-eddy simulation and unsteady aeroelastic code. We also optimize wind farm layouts and show that, for a simple problem with two wind directions and ten turbines, the fatigue damage can be constrained without sacrificing wind farm power production.

17 WIND ENERGY↗

PyCDFT: A Python package for constrained density functional theory

In this paper, we present PyCDFT, a Python package to compute diabatic states using constrained density functional theory (CDFT). PyCDFT provides an object-oriented, customizable implementation of CDFT, and allows for both single-point self-consistent-field calculations and geometry optimizations. PyCDFT is designed to interface with existing density functional theory (DFT) codes to perform CDFT calculations where constraint potentials are added to the Kohn–Sham Hamiltonian. Here, we demonstrate the use of PyCDFT by performing calculations with a massively parallel first-principles molecular dynamics code, Qbox, and we benchmark its accuracy by computing the electronic coupling between diabatic states for a set of organic molecules. We show that PyCDFT yields results in agreement with existing implementations and is a robust and flexible package for performing CDFT calculations. The program is available at https://dx.doi.org/10.5281/zenodo.3821097.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Kinetic Simulations of Microstructural Evolution (KSOME)

"Kinetic simulations of microstructural evolution" (KSOME) is an object Kinetic Monte Carlo (OMKC) simulation code. It is developed to simulate microstructural evolution in materials during irradiation. KSOME is developed from ground up with priority given to the flexibility, ease of upgradability, and computation efficiency, in that order. With previously developed simulation codes, various processes (more precisely, the diffusion-reaction processes) that can occur in a system were hardwired into the code. Hence, to perform higher fidelity simulations, a significant coding effort was required every time to incorporate either a more accurate description of existing processes or new processes. With KSOME, the necessity for frequent code upgrades whenever there is a need to perform higher fidelity simulations is either eliminated or reduced significantly. In KSOME, the categories of various diffusion-reaction processes and the data-management system are hardwired, while the execution of the diffusion-reaction processes specific to a system is specified via input files. In the present version of KSOME, the analytical expression required to calculate defect interaction radii are inputted via a text file. However, the ability to parse mathematical expressions from a text file can be extended to input the analytical expression to calculate other defect properties; including the expressions to calculate the change in the migration barriers of mobile defects due to long-range interaction with extended defects

Nandipati, Giridhar [Pacific Northwest National La↗

Characterization and Optimization of the Fitting of Quantum Correlation Functions

This case study presents a characterization and optimization of an application code for extracting parton distribution functions from high energy electron-proton scattering data. Profiling this application code reveals that the phase-space density computation accounts for 93% of the overall execution time for a single iteration on a single core. When executing multiple iterations in parallel on a multicore system, the application spends 78% of its overall execution time idling due to load imbalance. We address these issues by first transforming the application code from Python to C++ and then tackling the application load imbalance via a hybrid scheduling strategy that combines dynamic and static scheduling. These techniques result in a 62% reduction in CPU idle time and a 2.46x speedup in overall execution time per node. In addition, the typically enabled power-management mechanisms in supercomputers (e.g., AMD Turbo Core, Intel Turbo Boost, and RAPL) can significantly impact intra-node scalability when more than 50% of the CPU cores are used. This finding underscores the importance of understanding system interactions with power management, as they can adversely impact application performance, and highlights the necessity of intra-node scaling tests to identify performance degradation that inter-node scaling tests might otherwise overlook.

Chuang, Pi-Yueh [Virginia Tech,Dept. of Computer S↗

Coupling SCALE with DAKOTA for Axial Burnup Profiles Assessment in Burnup Credit

This paper presents a computational study that demonstrates the application of the SCALE code system in conjunction with the Design Analysis Kit for Optimization and Terascale Applications (DAKOTA) for the analysis of key factors influencing the evaluation of burnup credit (BUC) in pressurized water reactors (PWRs). The primary objective of this analysis is to characterize the model by utilizing parameterization, uncertainty quantification, and optimization studies. Using this approach, we can comprehensively assess the system and conduct informed predictive studies. This study highlights the effectiveness of the SCALE code system integrated within the DAKOTA framework in terms of efficiency and capability. With the coupling of the burnup code ORIGAMI with the CSAS or TSUNAMI-3D sequence embedded in a DAKOTA analysis, we can characterize the factors that influence the k eff of PWR 17x17 spent nuclear fuel (SNF) in the GBC-32 computational benchmark cask for the assessment of BUC in criticality safety analysis. The coupling methodology used in this study is not exclusive to BUC analysis. However, the choice to apply this methodology to the BUC problem is particularly significant because of the diverse range of aspects it encompasses in nuclear criticality safety analyses. This problem presents a unique opportunity to explore and address multiple facets of such analyses related to BUC and illustrates the capability of the SCALE code system with DAKOTA. This analysis makes use of historical reference data for the axial burnup profile, where the entire space within the bounds is considered. Both SCALE and DAKOTA are currently integrated in the Nuclear Energy Advanced Modeling Simulation (NEAMS) Workbench code system, which has a user-friendly graphical interface that simplifies the setup of simulations and configuration of input parameters as well as the visualization of simulation results.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Flag Gadgets Based on Classical Codes

Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024

Anker, Benjamin↗

Fast Characterization of Inducible Regions of Atrial Fibrillation Models With Multi-Fidelity Gaussian Process Classification

Computational models of atrial fibrillation have successfully been used to predict optimal ablation sites. A critical step to assess the effect of an ablation pattern is to pace the model from different, potentially random, locations to determine whether arrhythmias can be induced in the atria. In this work, we propose to use multi-fidelity Gaussian process classification on Riemannian manifolds to efficiently determine the regions in the atria where arrhythmias are inducible. We build a probabilistic classifier that operates directly on the atrial surface. We take advantage of lower resolution models to explore the atrial surface and combine seamlessly with high-resolution models to identify regions of inducibility. We test our methodology in 9 different cases, with different levels of fibrosis and ablation treatments, totalling 1,800 high resolution and 900 low resolution simulations of atrial fibrillation. When trained with 40 samples, our multi-fidelity classifier that combines low and high resolution models, shows a balanced accuracy that is, on average, 5.7% higher than a nearest neighbor classifier. We hope that this new technique will allow faster and more precise clinical applications of computational models for atrial fibrillation. All data and code accompanying this manuscript will be made publicly available at: https://github.com/fsahli/AtrialMFclass.

59 BASIC BIOLOGICAL SCIENCES↗

Bridging Python to Silicon: The SODA Toolchain

Systems performing scientific computing, data analysis, and machine learning tasks have a growing demand for application-specific accelerators that can provide high computational performance while meeting strict size and power requirements. However, the algorithms and applications that need to be accelerated are evolving at a rate that is incompatible with manual design processes based on hardware description languages. Agile hardware design tools based on compiler techniques can help by quickly producing an application-specific integrated circuit (ASIC) accelerator starting from a high-level algorithmic description. Here, we present the software-defined accelerator (SODA) synthesizer, a modular and open-source hardware compiler that provides automated end-to-end synthesis from high-level software frameworks to ASIC implementation, relying on multilevel representations to progressively lower and optimize the input code. Our approach does not require the application developer to write any register-transfer level code, and it is able to reach up to 364 giga floating point operations per second (GFLOPS)/W efficiency (32-bit precision) on typical convolutional neural network operators.

97 MATHEMATICS AND COMPUTING↗

Coupling Thermal-Hydraulics with Reactor Pressure Vessel Fracture Models

Because of the importance of maintaining the integrity of the reactor pressure vessel (RPV) in light-water reactors, significant effort has been devoted over the last several decades to understand the potential failure mechanisms, characterize how material properties evolve due to environmental conditions, and develop tools to assess the probability of fracture in aged RPVs during potential transient events. One important aspect of this problem that has not yet been fully addressed is the effects of nonuniform cooling on the RPV inner wall due to the way low-temperature water injected into the primary coolant system is distributed within the RPV during potential loss-of-coolant accident transients. Colder temperatures are expected in the regions near the inlets, causing a “cold-plume” effect. Rapid cooling of the RPV wall increases the likelihood of fracture initiation, and localized cooling due to cold-plume effects could potentially exacerbate this problem. The Grizzly code can perform a three-dimensional simulation of the RPV thermomechanical response as well as the probabilistic assessment of fracture for a population of pre-existing flaws, which is necessary to account for spatial variations in coolant temperature. This report documents a first effort to couple Grizzly RPV fracture models with computational fluid dynamics models performed using the Cardinal code, which allows for a realistic representation of the temperature distribution. This report demonstrates this coupling approach on two test cases: a simplified proof-of-concept scenario and a realistic small-break loss-of-coolant accident scenario. In both cases, the effects of the spatially varying temperature are evident; although, because the small-break loss-of-coolant accident scenario was far from challenging the RPV’s margins, it is still inconclusive how important cold-plume effects are in realistic accident scenarios. However, this effort represents an important step toward performing realistic analyses to determine to what extent spatially nonuniform cooling might affect RPV integrity under more aggressive accident scenarios.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

IrRep: Symmetry eigenvalues and irreducible representations of ab initio band structures

Here, we present IrRep – a Python code that calculates the symmetry eigenvalues of electronic Bloch states in crystalline solids and the irreducible representations under which they transform. As input it receives bandstructures computed with state-of-the-art Density Functional Theory codes such as VASP, Quantum Espresso, or Abinit, as well as any other code that has an interface to Wannier90. Our code is applicable to materials in any of the 230 space groups and double groups preserving time-reversal symmetry with or without spin-orbit coupling included, for primitive or conventional unit cells. This makes IrRep a powerful tool to systematically analyze the connectivity and topological classification of bands, as well as to detect insulators with non-trivial topology, following the Topological Quantum Chemistry formalism: IrRep can generate the input files needed to calculate the (physical) elementary band representations and the symmetry-based indicators using the [CheckTopologicalMat: https://www.cryst.ehu.es/cgi-bin/cryst/programs/magnetictopo.pl] routine of the Bilbao Crystallographic Server. It is also particularly suitable for interfaces with other plane-waves based codes, due to its flexible structure.

97 MATHEMATICS AND COMPUTING↗