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,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

QES-Plume v1.0: a Lagrangian dispersion model

Low-cost simulations providing accurate predictions of transport of airborne material in urban areas, vegetative canopies, and complex terrain are demanding because of the small-scale heterogeneity of the features influencing the mean flow and turbulence fields. Common models used to predict turbulent transport of passive scalars are based on the Lagrangian stochastic dispersion model. The Quick Environmental Simulation (QES) tool is a low-computational-cost framework developed to provide high-resolution wind and concentration fields in a variety of complex atmospheric-boundary-layer environments. Part of the framework, QES-Plume, is a Lagrangian dispersion code that uses a time-implicit integration scheme to solve the generalized Langevin equations which require mean flow and turbulence fields. Here, QES-Plume is driven by QES-Winds, a 3D fast-response model that computes mass-consistent wind fields around buildings, vegetation, and hills using empirical parameterizations, and QES-Turb, a local-mixing-length turbulence model. In this paper, the particle dispersion model is presented and validated against analytical solutions to examine QES-Plume’s performance under idealized conditions. In particular, QES-Plume is evaluated against a classical Gaussian plume model for an elevated continuous point-source release in uniform flow, the Lagrangian scaling of dispersion in isotropic turbulence, and a non-Gaussian plume model for an elevated continuous point-source release in a power-law boundary-layer flow. In these cases, QES-Plume yields a maximum relative error below 6 % when compared with analytical solutions. In addition, the model is tested against wind-tunnel data for a uniform array of cubical buildings. QES-Plume exhibits good agreement with the experiment with 99 % of matched zeros and 59 % of the predicted concentrations falling within a factor of 2 of the experimental concentrations. Furthermore, results also emphasize the importance of using high-quality turbulence models for particle dispersion in complex environments. Finally, QES-Plume demonstrates excellent computational performance.

58 GEOSCIENCES↗
DOE OSTI2022

GABLE contract source code

Garbled Autonomous Bots Leveraging Ethereum (GABLE) uses simple but effective algorithms to permit secure private execution of garbled state machines and garbled circuits on public computing resources. This release consists of two Solidity smart contracts illustrating the GABLE approach. 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. SAND2022-7215 O

Pattengale, Nicholas↗
DOE OSTI2023

Coded aperture and Compton imaging for the development of 225 Ac‐based radiopharmaceuticals

Abstract Background Targeted alpha‐particle therapy (TAT) has great promise as a cancer treatment. Arguably the most promising TAT radionuclide that has been proposed is 225 Ac. The development of 225 Ac‐based radiopharmaceuticals has been hampered due to the lack of effective means to study the daughter redistribution of these agents in small animals at the preclinical stage. Purpose The ability to directly image the daughters, namely 221 Fr and 213 Bi, via their gamma‐ray emissions would be a boon for preclinical studies. That said, conventional medical imaging modalities, including single photon emission computed tomography (SPECT) based on nonmultiplexed collimation, cannot be employed due to sensitivity limitations. Methods As an alternative, we propose the use of both coded aperture and Compton imaging with the former modality suited to the 218‐keV gamma‐ray emission of 221 Fr and the latter suited to the 440‐keV gamma‐ray emission of 213 Bi. Results This work includes coded aperture images of 221 Fr and Compton images of 213 Bi in tumor‐bearing mice injected with 225 Ac‐based radiopharmaceuticals. Conclusions These results are the first demonstration of visualizing and quantifying the 225 Ac daughters in small animals through the application of coded aperture and Compton imaging.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2020

Charon User Manual (V.2.1) (Rev.01)

This manual gives usage information for the Charon semiconductor device simulator. Charon was developed to meet the modeling needs of Sandia National Laboratories and to improve on the capabilities of the commercial TCAD simulators; in particular, the additional capabilities are running very large simulations on parallel computers and modeling displacement damage and other radiation effects in significant detail. The parallel capabilities are based around the MPI interface which allows the code to be ported to a large number of parallel systems, including linux clusters and proprietary "big iron" systems found at the national laboratories and in large industrial settings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

JACC: Leveraging HPC Meta-Programming and Performance Portability with the Just-in-Time and LLVM-based Julia Language

We present JACC (Julia for Accelerators), the first high-level, and performance-portable model for the just-in-time and LLVM-based Julia language. JACC provides a unified and lightweight front end across different back ends available in Julia, enabling the same Julia code to run efficiently on many HPC CPU and GPU targets. We evaluated the performance of JACC for common HPC kernels as well as for the most computationally demanding kernels used in applications, HPCCG, a supercomputing benchmark test for sparse domains, and HARVEY, a blood flow simulator to assist in the diagnosis and treatment of patients suffering from vascular diseases. We carried out the performance analysis on the most advanced US DOE supercomputers: Aurora, Frontier, and Perlmutter. Overall, we show that JACC has a negligible overhead versus vendor-specific solutions, reporting GPU speedups with no extra cost to programmability.

Valero-Lara, Pedro↗
DOE OSTI2022

Transforming Energy Through Computational Excellence: Bringing Low Mach Number Reactive Flow Simulations at the Exascale

PeleLMeX's unique capabilities are allowing for reactive flow modeling at unprecedented scales and a reasonable time and cost. The code is currently being extended to tackle more practical, design-oriented simulations by implementing Large Eddy Simulation and data-driven chemical models, providing a fast but accurate tool for engineers considering the emergence of GPU-accelerated platforms. These extensions are critical for enabling the physical insight required to design the next generation of combustion devices as a key component of a renewable energy future.

MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Modeling cross-beam energy transfer with sector ray tracing

Ray-based cross-beam energy transfer (CBET) models are an essential feature of the radiation-hydrodynamic codes used to simulate inertial confinement fusion implosions, but full 3D ray-based CBET calculations can have a prohibitively high computational cost. Sector ray tracing can be used to reduce the cost by orders of magnitude in cases where the coronal plasma and laser drive can be approximated as spherically symmetric. An extension of sector ray tracing (section ray tracing) can be used to relax the assumption of a spherically symmetric drive while still retaining most of the computational savings of a sector ray trace. We discuss the foundations of sector and section ray tracing and compare them to full ray tracing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Rendezvous algorithms for large-scale modeling and simulation

Rendezvous algorithms encode a communication pattern that is useful when processors sending data do not know who the receiving processors should be, or vice versa. The idea is to define an intermediate decomposition where datums from different sending processors can ”rendezvous” to perform a computation, in a manner that both the senders and eventual receivers of the results can identify the appropriate rendezvous processor. Though they were originally designed for interpolating between overlaid grids with independent parallel decompositions (Plimpton et al., 2004), we have recently found rendezvous algorithms useful for a variety of operations in particle- or grid-based simulation codes when running large problems on large numbers of processors. In particular, we show they can perform well when a load-balanced intermediate decomposition is randomized and not spatial, requiring all-to-all communication to move data between processors. In this case rendezvous algorithms leverage the large bisection communication bandwidths which parallel machines provide. We describe how rendezvous algorithms work in a scientific computing context and give specific examples for molecular dynamics and Direct Simulation Monte Carlo codes which result in dramatic performance improvements versus simpler algorithms which do not scale as well. We explain how a generic rendezvous algorithm can be implemented, and also point out similarities with the MapReduce paradigm popularized by Google and Hadoop.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An Initial Study of the Convergence Rate of Griffin’s Pebble Bed Reactors Algorithm

This paper presents an initial study of the convergence properties of an iterative algorithm for computing the burnup distribution in a pebble bed reactor (PBR) in its equilibrium core condition. The algorithm is implemented in the Griffin code. Griffin is a reactor multiphysics analysis application jointly developed by Idaho National Laboratory (INL) and Argonne National Laboratory (ANL). Griffin’s PBR algorithm is discussed and simulation data are presented. An alternative matrix formulation of the algorithm is presented that facilitates analysis of the iterative algorithm. The dependence of the spectral radius of the iterative algorithm on operational and discretization parameters is investigated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Transitioning GlideinWMS, a multi domain distributed workload manager, from GSI proxies to tokens and other granular credentials

GlideinWMS is a distributed workload manager that has been used in production for many years to provision resources for experiments like CERN’s CMS, many Neutrino experiments, and the OSG. Its security model was based mainly on GSI (Grid Security Infrastructure), using X.509 certificate proxies and VOMS (Virtual Organization Membership Service) extensions. Even when other credentials, like SSH keys, were used to authenticate with resources, proxies were also added all the time, to establish the identity of the requestor and the associated memberships or privileges. This single credential was used for everything and was, often implicitly, forwarded wherever needed. The addition of identity and access tokens and the phase-out of GSI forced us to reconsider the security model of GlideinWMS, to handle multiple credentials which can differ in type, technology, and functionality. Both identity tokens and access tokens are supported. GSI proxies even if no more mandatory, are still used, together with various JWT (JSON Web Token) based tokens and other certificates. The functionality of the credentials, defined by issuer, audience, and scope, also differ: a credential can allow access to a computing resource, or can protect the GlideinWMS framework from tampering, or can grant read or write access to storage, can provide an identity for accounting or auditing, or can provide a combination of any the formers. Furthermore, the tools in use do not include automatic forwarding and renewal of the new credentials so credential lifetime and renewal requirements became part of the discussion as well. In this paper, we will present how GlideinWMS was able to change its design and code to respond to all these changes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Versatile TRISO fuel particle modeling in Bison

Tri-structural isotropic (TRISO) fuel particles are a key component in several previous and current reactors as well as in a variety of novel nuclear reactor designs. Interest in TRISO fuel is on the rise, necessitating considerable computer modeling of TRISO fuel behavior in order to support related design and licensing activities. The Bison nuclear fuel performance code, which offers a full set of capabilities for modeling TRISO fuels, makes it easier to explore the various important aspects of TRISO fuel behavior. One key advantage of Bison is its ability to create meshes in 1D, 2D, and 3D. Users can customize these meshes for specific geometries, mesh densities, and use cases. This enables a wide variety of analyses, including thermal, structural, mass diffusion, homogenization, and statistical failure analyses. Furthermore, the meshing capability simplifies analysts’ workflows. The inherent mesh generation capability eliminates the need for separate mesh-generating software and mesh file management. Also, the fact that the meshes are customizable makes it straightforward to automate an investigation over a range of geometric parameters or mesh densities. Here, the present paper highlights the ease with which Bison may be used to create meshes for both simple and relatively complex TRISO fuel particles, and it explores the types of analyses enabled by these meshes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗
DOE OSTI2023

Overlapping Domain Coupling of Multidimensional and System Codes in NEAMS - Pronghorn and SAM

This report describes the implementation and testing of domain-overlapping coupling of the Pronghorn and SAM codes. Both Pronghorn and SAM are codes developed by the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program for analysis of advanced nuclear reactors. Pronghorn focuses on analyzing multi-dimensional core flow conditions, while SAM focuses on analysis of the entire system including, among other components, piping, pumps, and heat exchangers. It is desirable for many advanced reactor thermal-hydraulics simulations to couple Pronghorn and SAM to obtain self-consistent solutions in the core and the system. The domain-overlapping coupling approach provides a robust and numerically efficient candidate for this coupling. We describe the algorithm for obtaining self-consistent solutions between a SAM network of flow channels and an overlapped multi-dimensional Pronghorn domain. The algorithm is tested for a variety of simple canonical test problems and a model of the Molten Salt Reactor Experiment (MSRE). Results demonstrate that the domain overlapping coupling approach provides consistent pressure, mass flow rate, enthalpy, and passive scalar distributions between Pronghorn and SAM and converges reliably and efficiently (at most 15 iterations, usually much less than 10) for the considered test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large practical quantum circuits by providing resource estimates for the ground state estimation of molecules. Finally, we find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Advancement of hybrid fluid-kinetic modeling for HEDP and ICF science

We report on the development progress of a hybrid fluid-kinetic code for simulating fluids and plasmas in a wide range of environments, such as laser–matter interactions, inertial confinement fusion, magnetic confinement fusion, and pulsed power. The suite of numerical tools under development utilizes heterogeneous computer architectures and leverages the benefits of particle–based simulation techniques. By working to combine the kinetic particle-in-cell (PIC) model with a particle-based fluid simulation technique, such as smoothed particle hydrodynamics, we are developing a flexible framework capable of accurately modeling complex flows within and between kinetic and fluid regimes. The TriForce code is under development as a C++ framework for parallel, 3D, particle-based, hybrid fluid-kinetic plasma simulations. The fluid half of TriForce will be based upon the meshless smoothed-particle-hydrodynamics (SPH) approach, well-suited for shear, mixing, and turbulence, whereas the kinetic half resembles a traditional particle-in-cell (PIC) code; other particle-based approaches to fluid modeling that do use a mesh are also possible to use and are under investigation. Maxwell’s electromagnetic field equations are solved either via explicit or implicit algorithms or approximated via resistive magnetohydrodynamics (MHD) using an Ohm’s law and resulting induction equation (extended MHD is under development). A primary goal of enabling direct comparisons, from the same code, between results from the variants of MHD and implicit electromagnetic solutions is to improve our fundamental understanding of systems with magnetic fields. The code is under development to recover results from both radiation-MHD and fully kinetic codes in those limits, and is continuing to be developed from other follow-on grants to operate in between where both descriptions may co-exist and interact. For certain applications, it is desired for a simulation to contain fluid ions and electrons as well as kinetic ions and electrons. Typically, it is too computationally intensive to model a full-scale ICF or HEDP experiment fully kinetically since many cycles are expended with very small time steps on modeling the fluid part of a material that is well treated by the fluid approximation. In this case, many traditional PIC particles can be replaced with a single fluid particle representing the thermal part of the distribution function, and there are fewer needed kinetic particles, which describe the non-thermal part and can be sub-cycled relative to the fluid particle advance. Furthermore, a pure fluid code may, depending on the problem, simply lack many physically important details that are beyond the scope of its reduced approximations and assumptions. In this report, we summarize the objectives achieved in the development of the collisional and kinetic half of the code, and the physics problems to which the code has been applied in the areas of advanced and innovative fusion concepts, pulsed power, and magneto-inertial fusion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

MOOSE ProbML: Parallelized probabilistic machine learning and uncertainty quantification for computational energy applications

Here, this paper presents the development and demonstration of massively parallel probabilistic machine learning (ML) and uncertainty quantification (UQ) capabilities within the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open-source computational platform for parallel finite element and finite volume analyses. In addressing the computational expense and uncertainties inherent in complex multiphysics simulations, this paper integrates Gaussian process (GP) variants, active learning, Bayesian inverse UQ, adaptive forward UQ, Bayesian optimization, evolutionary optimization, and Markov chain Monte Carlo (MCMC) within MOOSE. It also elaborates on the interaction among key MOOSE systems — Sampler, MultiApp, Reporter, and Surrogate — in enabling these capabilities. The modularity offered by these systems enables development of a multitude of probabilistic ML and UQ algorithms in MOOSE. Example code demonstrations include parallel active learning and parallel Bayesian inference via active learning. The impact of these developments is illustrated through five applications relevant to computational energy applications: UQ of nuclear fuel fission product release, using parallel active learning Bayesian inference; very rare events analysis in nuclear microreactors using active learning; advanced manufacturing process modeling using multi-output GPs (MOGPs) and dimensionality reduction; fluid flow using deep GPs (DGPs); and tritium transport model parameter optimization for fusion energy, using batch Bayesian optimization. These capabilities are part of the MOOSE framework.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2020

ECP ST Capability Assessment Report (CAR) for VTK-m (FY20)

The ECP/VTK-m project is providing the core capabilities to perform scientific visualization on Exascale architectures. The ECP/VTK-m project fills the critical feature gap of performing visualization and analysis on processors like graphics-based processors. The results of this project will be delivered in tools like ParaView, Vislt, and Ascent as well as in stand-alone form. Moreover, these projects are depending on this ECP effort to be able to make effective use of ECP architectures. One of the biggest recent changes in high-performance computing is the increasing use of accelerators. Accelerators contain processing cores that independently are inferior to a core in a typical CPU, but these cores are replicated and grouped such that their aggregate execution provides a very high computation rate at a much lower power. Current and future CPU processors also require much more explicit parallelism. Each successive version of the hardware packs more cores into each processor, and technologies like hyper threading and vector operations require even more parallel processing to leverage each core's full potential. VTK-m is a toolkit of scientific visualization algorithms for emerging processor architectures. VTK-m supports the fine-grained concurrency for data analysis and visualization algorithms required to drive extreme scale computing by providing abstract models for data and execution that can be applied to a variety of algorithms across many different processor architectures. The ECP/VTK-m project is building up the VTK-m codebase with the necessary visualization algorithm implementations that run across the varied hardware platforms to be leveraged at the Exascale. We will be working with other ECP projects, such as ALPINE, to integrate the new VTK-m code into production software to enable visualization on our HPC systems.

97 MATHEMATICS AND COMPUTING↗