SEARCH · Engineering Papers

Results for “accelerated 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.

SourceResearch connectionFrom yearThrough year

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

At least 1,495 records · Page 83

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Design Optimization of A generic Fissile Solution for Mo99 production using Electron Beam-based Neutron Generator using MCNP+CFD

Molybdenum-99 ( 99 Mo) is a medical isotope used in 80% of all medical imaging procedures today. However, 99 Mo is not directly administered to patients for imaging; its decay product, technetium-99m ( 99 mTc), is a metastable isotope with a half-life of ~6 hours. Such a short half-life does not allow for production, separation, and application to a patient before decaying further. Therefore, the solution is to produce the precursor to 99 mTc, 99 Mo. 99 Mo has a half-life of 66 hours, long enough to produce the material and send it to the desired location before it fully decays. Under National Nuclear Security Administration’s (NNSA) highly enriched uranium (HEU) minimization mission, the Material Management and Minimization (M3) office leads the Molybdenum-99 (Mo-99) program. A major goal of the Mo-99 program is to develop methods of producing 99 Mo using low enriched uranium (LEU) opposed to the traditionally used HEU domestically in the U.S. Internationally, LEU is the new standard for use in research reactors and isotope production facility. In this study, we introduce a generic fissile solution system for 99 Mo production facility meeting the design requirement of 1) LEU usage as fissile material and 2) subcritical fissile system coupled with a horizontal electron beam (E-beam) accelerator. The focus of this research is to optimize a fissile solution configuration for maximum 99 Mo production yield using MCNP model, and ultimately implement the optimized design with computational fluid dynamics (CFD) model to understand thermal hydraulic behavior and solution convection characteristic. The report consists of two parts: 1) isotope yield calculation and criticality analysis with a wide range of parametric test matrix, and 2) thermal hydraulic analysis for solution mixing and cooling assessment.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2023

Modeling a Miniature Voitenko-Like Explosively-Driven Shock Tube Using FLAG

Using the FLAG hydrocode, hypervelocity plasma jets observed in miniature explosively–driven shock tube experiments have been modeled with a relative error in velocity of less than 5% (a reduction from previous attempts which yielded errors of 37%). This suggests that FLAG may be well-suited to model HE systems involving the acceleration of gases through complex crack systems in HE devices: A phenomenon not accurately captured using current modeling capabilities. The Eulerian hydrocode model presented here leverages AMR to reduce computational cost and, importantly, it was found that mesh resolution and model geometry each significantly affected the average jet velocity. The model and the results are detailed here together with comments on challenges during its development and avenues for future work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A cross-platform execution engine for the quantum intermediate representation

Hybrid languages like the quantum intermediate representation (QIR) are essential for programming systems that mix quantum and conventional computing models, while execution of these programs is often deferred to a system-specific implementation. Here, we develop the QIR Execution Engine (QIR-EE) for parsing, interpreting, and executing QIR across multiple hardware platforms. QIR-EE uses LLVM to execute hybrid instructions specifying quantum programs and, by design, presents extension points that support customized runtime and hardware environments. We demonstrate an implementation that uses the XACC quantum hardware-accelerator library to dispatch prototypical quantum programs on different commercial quantum platforms and numerical simulators, and we validate execution of QIR-EE on IonQ, Quantinuum, and IBM hardware. Our results highlight the efficiency of hybrid executable architectures for handling mixed instructions, managing mixed data, and integrating with quantum computing frameworks to realize cross-platform execution.

LLVM↗

DOE OSTI2026

Microsecond-latency feedback at a particle accelerator by online reinforcement learning on hardware

The commissioning and operation of future large-scale scientific experiments will challenge current tuning and control methods. Reinforcement learning (RL) algorithms are a promising solution due to their ability to dynamically adapt to changing environments and consider delayed consequences. In many real-world applications, RL policies must produce actions in real time, often within microseconds to milliseconds, imposing significant constraints on system latency and computational overhead that conventional machine learning libraries are not designed to handle. To control phenomena in real time at these timescales, RL needs to be deployed on-the-edge, namely on dedicated hardware located near the system it controls, without relying on a host CPU or cloud-based inference. In this work we present the design and deployment of an experience accumulator system in a particle accelerator. In this system, deep-RL algorithms run using hardware acceleration and act within a few microseconds, enabling the use of RL for control of phenomena like beam instabilities. The training uses the collected data offline to reduce the number of operations carried out on the acceleration hardware. The proposed architecture was tested in real experimental conditions at the Karlsruhe research accelerator, a synchrotron light source, where the system was used to control artificially induced horizontal betatron oscillations in real-time, with a control loop period of just 2.7 μs. The results showed a performance comparable to the commercial feedback system available at the accelerator, demonstrating the viability and potential of this approach. Due to the self-learning and reconfiguration capability of this implementation, a seamless application to other control problems is possible. Applications range from particle accelerators to large-scale research and industrial facilities.

FPGA↗

DOE OSTI2021

Developing a Hybrid Electric Vehicle Eco-Cooperative Adaptive Cruise Control System at Signalized Intersections.

This study develops an eco-driving strategy for hybrid electric vehicles (HEVs) in the vicinity of signalized intersections, entitled HEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The proposed system computes real-time, energy-optimized vehicle trajectories using HEV vehicle dynamics and energy consumption models. In the proposed system, a simple HEV energy model is used to compute the instantaneous fuel consumption. This HEV energy model is selected since it is general, transferable, and can be easily used to compute instantaneous energy consumption levels for HEVs without the additional input of vehicle engine data or complicated power control strategies. In addition, a vehicle dynamics model is used to capture the relationship between speed, acceleration level, and tractive/resistance forces on vehicles. The energy-optimum problem is formulated as an optimization problem with constraints, which is solved using a moving-horizon dynamic programming approach. The proposed HEV Eco-CACC-I system was tested to evaluate its performance for various speed limits, roadway grades, and signal timings. Lastly, the proposed HEV controller was implemented in a microscopic traffic simulation software to test its network-wide performance. The test results from an arterial corridor with three signalized intersections demonstrate that the proposed system can effectively reduce stop-and-go traffic in the vicinity of signalized intersections producing savings of 7.4% in energy consumption, 5.8% in traffic delay and 23% vehicle stops, respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

LC-MEMENTO: A Memory Model for Accelerated Architectures

With the advent of heterogeneous architectures, in particular, with the ubiquity of multi-GPU systems, it is becoming increasingly important to manage device memory efficiently in order to reap the benefits of the additional core count. To date, such responsibility mainly falls on the programmer where device-to-host data communication (and vice versa), if not done properly, may incur costly memory transfer operations and synchronization. The problem may be compounded by additional requirement to maintain system-wide memory consistency that may involve expensive synchronization overhead. In this paper, we present Location Consistency Memory Model for Enhanced Transfer Operations (LC-MEMENTO). This framework considers incorporating runtime techniques for multi-GPU memory management to support relaxed synchronization semantics and memory transfer operations automatically. Specifically, we implement a relaxed form of a memory consistency model based on the Location Consistency (LC) in an Asynchronous Many-Task Runtime (ARTS) and demonstrate that, this memory model enables additional optimization opportunities for the three representative applications encompassing different computational patterns (scientific computation, graphs, data streaming, etc.).

Memory Models, Accelerators, Adaptive Optimization↗

DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

DOE OSTI2024

A generative artificial intelligence framework based on a molecular diffusion model for the design of metal-organic frameworks for carbon capture

Metal-organic frameworks (MOFs) exhibit great promise for CO 2 capture. However, finding the best performing materials poses computational and experimental grand challenges in view of the vast chemical space of potential building blocks. Here, we introduce GHP-MOFassemble, a generative artificial intelligence (AI), high performance framework for the rational and accelerated design of MOFs with high CO 2 adsorption capacity and synthesizable linkers. GHP-MOFassemble generates novel linkers, assembled with one of three pre-selected metal nodes (Cu paddlewheel, Zn paddlewheel, Zn tetramer) into MOFs in a primitive cubic topology. GHP-MOFassemble screens and validates AI-generated MOFs for uniqueness, synthesizability, structural validity, uses molecular dynamics simulations to study their stability and chemical consistency, and crystal graph neural networks and Grand Canonical Monte Carlo simulations to quantify their CO 2 adsorption capacities. We present the top six AI-generated MOFs with CO 2 capacities greater than 2m mol g -1 , i.e., higher than 96.9% of structures in the hypothetical MOF dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Predicting beam transmission using 2-dimensional phase space projections of hadron accelerators

We present a method to compress the 2D transverse phase space projections from a hadron accelerator and use that information to predict the beam transmission. This method assumes that obtaining at least three projections of the 4D transverse phase space is possible and that an accurate simulation model is available for the beamline. Using a simulated model, we show that—a computer can train a convolutional autoencoder to reduce phase-space information which can later be used to predict the beam transmission. Finally, we argue that although using projections from a realistic nonlinear distribution produces less accurate results, the method still generalizes well.

43 PARTICLE ACCELERATORS↗

DOE OSTI2022

First Plant Cell Atlas symposium report

The Plant Cell Atlas (PCA) community hosted a virtual symposium on December 9 and 10, 2021 on single cell and spatial omics technologies. The conference gathered almost 500 academic, industry, and government leaders to identify the needs and directions of the PCA community and to explore how establishing a data synthesis center would address these needs and accelerate progress. This report details the presentations and discussions focused on the possibility of a data synthesis center for a PCA and the expected impacts of such a center on advancing science and technology globally. Community discussions focused on topics such as data analysis tools and annotation standards; computational expertise and cyber-infrastructure; modes of community organization and engagement; methods for ensuring a broad reach in the PCA community; recruitment, training, and nurturing of new talent; and the overall impact of the PCA initiative. These targeted discussions facilitated dialogue among the participants to gauge whether PCA might be a vehicle for formulating a data synthesis center. The conversations also explored how online tools can be leveraged to help broaden the reach of the PCA (i.e., online contests, virtual networking, and social media stakeholder engagement) and decrease costs of conducting research (e.g., virtual REU opportunities). Major recommendations for the future of the PCA included establishing standards, creating dashboards for easy and intuitive access to data, and engaging with a broad community of stakeholders. The discussions also identified the following as being essential to the PCA's success: identifying homologous cell-type markers and their biocuration, publishing datasets and computational pipelines, utilizing online tools for communication (such as Slack), and user-friendly data visualization and data sharing. In conclusion, the development of a data synthesis center will help the PCA community achieve these goals by providing a centralized repository for existing and new data, a platform for sharing tools, and new analytical approaches through collaborative, multidisciplinary efforts. A data synthesis center will help the PCA reach milestones, such as community-supported data evaluation metrics, accelerating plant research necessary for human and environmental health.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Proton Acceleration in Low- β Magnetic Reconnection with Energetic Particle Feedback

Magnetic reconnection regions in space and astrophysics are known as active particle acceleration sites. There is ample evidence showing that energetic particles can take a substantial amount of converted energy during magnetic reconnection. However, there has been a lack of studies understanding the backreaction of energetic particles at magnetohydrodynamical scales in magnetic reconnection. To address this, we have developed a new computational method to explore the feedback by nonthermal energetic particles. This approach considers the backreaction from these energetic particles by incorporating their pressure into magnetohydrodynamics (MHD) equations. The pressure of the energetic particles is evaluated from their distribution evolved through Parker's transport equation, solved using stochastic differential equations (SDEs), so we coin the name MHD-SDE. Applying this method to low-β magnetic reconnection simulations, we find that reconnection is capable of accelerating a large fraction of energetic particles that contain a substantial amount of energy. When the feedback from these particles is included, their pressure suppresses the compression structures generated by magnetic reconnection, thereby mediating particle energization. Consequently, the feedback from energetic particles results in a steeper power-law energy spectrum. These findings suggest that feedback from nonthermal energetic particles plays a crucial role in magnetic reconnection and particle acceleration.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Machine learning for modern power distribution systems: Progress and perspectives

The application of machine learning (ML) to power and energy systems (PES) is being researched at an astounding rate, resulting in a significant number of recent additions to the literature. As the infrastructure of electric power systems evolves, so does interest in deploying ML techniques to PES. However, despite growing interest, the limited number of reported real-world applications suggests that the gap between research and practice is yet to be fully bridged. To help highlight areas where this gap could be narrowed, this article discusses the challenges and opportunities in developing and adapting ML techniques for modern electric power systems, with a particular focus on power distribution systems. These systems play a crucial role in transforming the electric power sector and accommodating emerging distributed technologies to mitigate the impacts of climate change and accelerate the transition to a sustainable energy future. The objective of this article is not to provide an exhaustive overview of the state-of-the-art in the literature, but rather to make the topic accessible to readers with an engineering or computer science background and an interest in the field of ML for PES, thereby encouraging cross-disciplinary research in this rapidly developing field. To this end, the article discusses the ways in which ML can contribute to addressing the evolving operational challenges facing power distribution systems and identifies relevant application areas that exemplify the potential for ML to make near-term contributions. At the same time, key considerations for the practical implementation of ML in power distribution systems are discussed, along with suggestions for several potential future directions.

Marković, Marija (ORCID:0000000247839837)↗

DOE OSTI2024

BCSR on GPU: A Way Forward Extreme-scale Graph Processing on Accelerator-enabled Frontier Supercomputer

Handling large graphs in a distributed environment requires effective partitioning across processors and efficient management of local partitions. In 2D partitioning, local graphs often become too sparse, making memory-efficient data structures crucial. Using the Compressed Sparse Row (CSR) format wastes space, especially for > 83% of vertices with empty edges for the sparse graphs. This study explores bit-CSR (BCSR), a modified CSR representation, on GPUs to reduce memory usage in graph computations. We achieved 16.67% memory savings on a sparse rmat dataset with 268 million vertices and 357 million edges, without performance degradation, supported by both theoretical and experimental storage savings of 33%. However, we observed a 1.7× slowdown in degree lookup times due to bitwise operations on AMD CPUs. This analysis highlights the potential of BCSR on GPUs for improving Graph500 benchmark performance on GPU-accelerated systems, such as the Frontier supercomputer.

Sattar, Naw Safrin↗

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 OSTI2023

Accelerating the density-functional tight-binding method using graphical processing units

Acceleration of the density-functional tight-binding (DFTB) method on single and multiple graphical processing units (GPUs) was accomplished using the MAGMA linear algebra library. Herein two major computational bottlenecks of DFTB ground-state calculations were addressed in our implementation: the Hamiltonian matrix diagonalization and the density matrix construction. The code was implemented and benchmarked on two different computer systems: (1) the SUMMIT IBM Power9 supercomputer at the Oak Ridge National Laboratory Leadership Computing Facility with 1–6 NVIDIA Volta V100 GPUs per computer node and (2) an in-house Intel Xeon computer with 1–2 NVIDIA Tesla P100 GPUs. The performance and parallel scalability were measured for three molecular models of 1-, 2-, and 3-dimensional chemical systems, represented by carbon nanotubes, covalent organic frameworks, and water clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

A domain decomposition preconditioning for an inverse volume scattering problem

In this work, we propose domain decomposition preconditioners for the solution of an integral equation formulation of the acoustic forward and inverse scattering problems. We study both forward and inverse volume problems and propose preconditioning techniques to accelerate the iterative solvers. For the forward scattering problem, we extend the domain decomposition based preconditioning techniques presented for partial differential equations in Cai and Sarkis (1999 SIAM J. Sci. Comput. 21 792–797), to integral equations. We combine this domain decomposition preconditioner with a low-rank correction, which is easy to construct, forming a new preconditioner. For the inverse scattering problem, we use the forward problem preconditioner as a building block for constructing a preconditioner for the Gauss–Newton Hessian. We present numerical results that demonstrate the performance of both preconditioning strategies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Numerical simulation of frost formation and heat transfer on fin-and-tube heat exchangers in turbulent cross-flow

Frost formation in fin-and-tube heat exchangers in turbulent cross-flow presents significant challenges in industrial refrigeration applications, affecting heat transfer efficiency and operational reliability. The purpose of this work is to investigate frost deposition and growth on a staggered bank of a fin-and-tube freezer coil under turbulent forced convection conditions. The focus here is on investigating conditions that closely replicate real-world scenarios in large walk-in industrial freezers. Using a direct numerical simulation approach, we examine the flow dynamics and thermal behaviour in the presence of frost, considering turbulent regimes characterized by a Reynolds number in the range 1050 ≤ R e D , avg ≤ 4800 , with the characteristic length being the outer diameter of the tube and the velocity being the bulk fluid velocity between the plates (fins). Computational fluid dynamics simulations are employed to resolve the interactions between turbulent airflow and the frost layer. Our approach incorporates a modified immersed boundary method and a slow-time acceleration technique to address the complex dynamic interface between the continuously evolving frost layer and the flowing air stream. Our findings indicate that frost forms more on the sides of the finned surfaces (plates) and less on the tubes themselves. This article is part of the theme issue ‘Heat and mass transfer in frost and ice’.

Science & Technology - Other Topics↗