Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “future of 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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Multiscale Nuclear-Electronic Orbital Quantum Dynamics in Complex Environments

Many renewable energy conversion processes rely on the movement of protons as well as electrons through either electrocatalysis or photoexcitation. The simulation of such processes requires a quantum mechanical description of coupled nuclear-electronic dynamics in a solvent or heterogeneous chemical environment. The overall objective of this project is the development of theoretical and computational capabilities for simulating nuclear-electronic quantum dynamics in complex environments and the creation of high-performance, open-source software. This multiscale framework will enable simulations of the real-time dynamics of nonequilibrium excited state proton-coupled electron transfer, quantum decoherence, vibronic energy transfer, and ultrafast radiolysis, as well as their associated time-resolved multidimensional spectroscopies. An important outcome of this project will be a sustainable, reusable, and interoperable open-source software ecosystem. This software will be designed for emerging exascale and future national leadership computers. Another key outcome will be a multiscale quantum dynamics method and software enabling simulations of nonequilibrium nuclear-electronic quantum dynamics in complex environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Estimating Biofuel Feedstock Water Footprints Using System Dynamics

Increased biofuel production has prompted concerns about the environmental tradeoffs of biofuels compared to petroleum-based fuels. Biofuel production in general, and feedstock production in particular, is under increased scrutiny. Water footprinting (measuring direct and indirect water use) has been proposed as one measure to evaluate water use in the context of concerns about depleting rural water supplies through activities such as irrigation for large-scale agriculture. Water footprinting literature has often been limited in one or more key aspects: complete assessment across multiple water stocks (e.g., vadose zone, surface, and ground water stocks), geographical resolution of data, consistent representation of many feedstocks, and flexibility to perform scenario analysis. We developed a model called BioSpatial H2O using a system dynamics modeling and database framework. BioSpatial H2O could be used to consistently evaluate the complete water footprints of multiple biomass feedstocks at high geospatial resolutions. BioSpatial H2O has the flexibility to perform simultaneous scenario analysis of current and potential future crops under alternative yield and climate conditions. In this proof-of-concept paper, we modeled corn grain (Zea mays L.) and soybeans (Glycine max) under current conditions as illustrative results. BioSpatial H2O links to a unique database that houses annual spatially explicit climate, soil, and plant physiological data. Parameters from the database are used as inputs to our system dynamics model for estimating annual crop water requirements using daily time steps. Based on our review of the literature, estimated green water footprints are comparable to other modeled results, suggesting that BioSpatial H2O is computationally sound for future scenario analysis. Our modeling framework builds on previous water use analyses to provide a platform for scenario-based assessment. BioSpatial H2O's system dynamics is a flexible and user-friendly interface for on-demand, spatially explicit, water use scenario analysis for many US agricultural crops. Built-in controls permit users to quickly make modifications to the model assumptions, such as those affecting yield, and to see the implications of those results in real time. BioSpatial H2O's dynamic capabilities and adjustable climate data allow for analyses of water use and management scenarios to inform current and potential future bioenergy policies. The model could also be adapted for scenario analysis of alternative climatic conditions and comparison of multiple crops. The results of such an analysis would help identify risks associated with water use competition among feedstocks in certain regions. Results could also inform research and development efforts that seek to reduce water-related risks of biofuel pathways.

09 BIOMASS FUELS↗
DOE OSTI2021

Neuromorphic Graph Algorithms: Cycle Detection, Odd Cycle Detection, and Max Flow

Neuromorphic computing is poised to become a promising computing paradigm in the post Moore’s law era due to its extremely low power usage and inherent parallelism. Spiking neural networks are the traditional use case for neuromorphic systems, and have proven to be highly effective at machine learning tasks such as control problems. More recently, neuromorphic systems have been applied outside of the arena of machine learning, primarily in the field of graph algorithms. Neuromorphic systems have been shown to perform graph algorithms faster and with lower power consumption than their traditional (GPU/CPU) counterparts, and are hence an attractive option for a co-processing unit in future high performance computing systems, where graph algorithms play a critical role. In this paper, we present a neuromorphic implementation of cycle detection, odd cycle detection, and the Ford-Fulkerson max-flow algorithm. We further evaluate the performance of these implementations using the NEST neuromorphic simulator by using spike counts and simulation time as proxies for energy consumption and run time. In addition to gains inherent in neuromorphic systems, we show that within the neuromorphic implementations early stopping criteria can be implemented to further improve performance.

Kay, Bill↗
DOE OSTI2026

Shadow of the Future: Developing Trust and Software within the Exascale Computing Project

Collaboration and team science are emerging areas of interest in software production. Historically, multi-institutional research collaborations are difficult to initiate and maintain, negatively impacting communication, negotiation, and dialogue between industry, government, and academic researchers. The Exascale Computing Project (ECP), a massive, multi-team, high-stakes initiative, facilitated broader research collaboration under a shared funding structure and extended timeline to support scientific discovery. Here, we conducted interviews with ECP teams, representing a variety of domain specialties, research institutions, and programming backgrounds. Using thematic analysis, we assessed how ECP’s structure created an environment of increased trust among projects and how software shared between teams facilitated sustained collaboration. We found that the expectation of future collaboration, i.e., the shadow of the future, greatly enhanced trust among teams and the quality of scientific software produced. Based on our findings within ECP projects, we connect to the existing literature on trust in software engineering and share recommendations for sustainable multi-institutional collaboration and shared best software practices.

Exascale computing project↗
DOE OSTI2024

Enhancing risk and crisis communication with computational methods: A systematic literature review

Abstract Recent developments in risk and crisis communication (RCC) research combine social science theory and data science tools to construct effective risk messages efficiently. However, current systematic literature reviews (SLRs) on RCC primarily focus on computationally assessing message efficacy as opposed to message efficiency. We conduct an SLR to highlight any current computational methods that improve message construction efficacy and efficiency. We found that most RCC research focuses on using theoretical frameworks and computational methods to analyze or classify message elements that improve efficacy. For improving message efficiency, computational and manual methods are only used in message classification. Specifying the computational methods used in message construction is sparse. We recommend that future RCC research apply computational methods toward improving efficacy and efficiency in message construction. By improving message construction efficacy and efficiency, RCC messaging would quickly warn and better inform affected communities impacted by current hazards. Such messaging has the potential to save as many lives as possible.

Mathematical Methods In Social Sciences↗
DOE OSTI2019

Umpire: Application-Focused Management and Coordination of Complex Hierarchical Memory

Advanced architectures like Sierra provide a wide range of memory resources that must often be carefully controlled by the user. These resources have varying capacities, access timing rules, and visibility to different compute resources. Applications must intelligently allocate data in these spaces, and depending on the total amount of memory required, applications may also be forced to move data between different parts of the memory hierarchy. Finally, applications using multiple packages must coordinate effectively to ensure that each package can use the memory resources it needs. To address these challenges, we present Umpire, an application-oriented library for managing memory resources. Specifically, Umpire provides support for querying memory resources, provisioning and allocating memory, and memory introspection. It allows computer scientists and computational physicists to efficiently program the memory hierarchies of current and future high-performance computing architectures, without tying their application to specific hardware or software. In this paper, we describe the design and implementation of Umpire and present case studies from the integration of Umpire into applications that are currently running on Sierra.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Investigation of Portable Event-Based Monte Carlo Transport Using the NVIDIA Thrust Library

Power consumption considerations are driving future high performance computing platforms toward many-core computing architectures. Los Alamos National Laboratory's Trinity machine, available in 2016, will use both Intel Xeon Haswell processors and Intel Xeon Phi Knights Landing many integrated core (MIC) architecture coprocessors. Lawrence Livermore National Laboratory's Sierra machine, available in 2018, will use an IBM PowerPC architecture along with Nvidia graphics processing unit (GPU) architecture accelerators. These different advanced architectures make the computing landscape in upcoming years complex. Traditional approaches to Monte Carlo transport do not work efficiently on these new computing platforms. MIC architectures require vectorization to operate efficiently, and vectorization is difficult to achieve in Monte Carlo transport. GPU architectures require additional code to explicitly use the hardware, requiring significant code changes or hardware specific branches in the source code. A significant challenge for Monte Carlo transport projects is to simultaneously support within a single source code base efficient simulations for both the current generation of architectures and the different advanced computing architectures. In order to address these challenges, two important changes are typically required: a new algorithmic approach for solving Monte Carlo transport, and explicit use of hardware specific software. In this paper, we describe initial research investigations of an event-based Monte Carlo transport algorithm implemented using the Nvidia Thrust library on a GPU for a Monte Carlo test code. The event-based algorithm targets many-core architectures by increasing SIMD (single instruction multiple data) parallelism, while Thrust potentially provides portable performance by allowing one source code base to compile code targeted for both CPUs and GPUs. We described preliminary investigations of portable event-based Monte Carlo algorithms implemented using the Nvidia Thrust library in a research Monte Carlo test code. We found that an explicit CUDA implementation of an event-based Monte Carlo algorithm performed significantly more efficiently than a Thrust implementation on GPU platforms, most likely as a result of additional flexibility in access to different memory spaces on the GPU. Additionally, we showed that on GPU platforms and at large enough problem sizes the event-based implementations perform more efficiently than the serial history-based implementation running on the host CPU. While investigating this problem, we also discovered that the performance of the event-based algorithm is affected by what tallies are being used. A zonal scalar flux tally requires atomic operations that significantly impacted the performance of the code, in some cases producing slowdowns instead of speedups. We decided to remove the tally in order to focus on the effectiveness of the event-based algorithm. Future work will be required to research more effective ways of handling such tallies. Additionally, we would like to consider new ways for optimizing both the Thrust and CUDA versions, in order to see how much performance we have yet to achieve. The potential trade-off between portability and performance was demonstrated in this investigation. Thrust provides both CPU and GPU versions of the code in one code base, but it does so at a cost. We discovered approximately a factor of 2-5 performance difference between Thrust and CUDA on each GPU platform we tested. Thrust provides a tool to access the GPUs with less effort and specialization, but it does so by giving up fine grained control where extra performance can be found for this application. Future work will be required to determine whether this performance differential between Thrust and CUDA can be reduced for event-based Monte Carlo transport. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗
DOE OSTI2016

Error Propagation for Response Matrix Methods in the Many Node Limit

The response matrix method has been a useful solution method for radiation transport problems for decades. The method is desirable for many reasons. It can be extended to both fixed source and eigenvalue problems. In addition, a key aspect of the method is a shift of computational expense to a precomputation phase. Methods and codes employing response matrix or response matrix-like methods have enjoyed formidable computational efficiency while solving large problems. However, current applications of the method rely on large node sizes and few nodes to maximize computational efficiency. As part of a desire to make these methods more amenable to applications such as parallel computing in the future, the number of nodes in problems may increase, and node size will decrease. The effect of this change has not been well studied except for a few cases. In the past, it was determined that a poor approximation of angular dependence of flux on node interfaces could lead to large error propagation for fixed source problems, but a newer study indicates that changing node sizes as well as number of nodes poses little challenge for response methods in the eigenvalue case. This paper presents the unintuitive result that for response matrix methods increasing the spatial resolution of the problem may dramatically decrease accuracy - this effect is demonstrated on a simple analytic 1-D benchmark problem. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Modeling the influence of nozzle-generated turbulence on diesel sprays

The physical mechanisms governing spray breakup in direct injection engines, such as aerodynamic induced instabilities and nozzle-generated cavitation and turbulence, are not well understood due to the experimental and computational limitations in resolving these processes. Recent x-ray and visible extinction measurements have been con-ducted with a targeted interest in the spray formation region in order to characterize the distribution of droplet sizes throughout the spray. Detailed analysis of these measurements shows promise of yielding insight into likely mechanisms governing atomization, which can inform the improvement of spray models for engine computational fluid dynamic (CFD) codes. In order to investigate potential atomization mechanisms, we employ a joint experimental and computational approach to characterize the structure of the spray formation region using the Engine Combustion Network Spray D injector. X-ray tomography, radiography and ultra-small angle x-ray scattering measurements conducted at the Advanced Photon Source at Argonne National Laboratory quantify the injector geometry, liquid fuel mass and Sauter mean diameter (SMD) distributions under non-vaporizing conditions. Diffused back-illumination imaging measurements, conducted at the Georgia Institute of Technology, characterize the asymmetry of the spray structure. The selected range of injection pressures (50 – 150 MPa) and ambient densities (1.2 – 22.8 kg/m3) allow for the influence of aerodynamic forces on the spray to be studied in a controlled and systematic manner, while isolating the atomization process from the effects of vaporization. In comparison to high ambient density conditions, the spray is observed to be more asymmetric at low ambient density conditions. Although several mechanisms may cause asymmetries in the nozzle exit flow conditions and ultimately the spray distribution, irregularities in the internal nozzle geometry were identified, suggesting an increased sensitivity of the spray structure to internal nozzle surface finish imperfections at such conditions. The presence of these asymmetries may influence the ability to interpret line-of-sight measurements and their derived SMD values and trends from a single viewing angle of the spray. With this consideration in mind, the measured local sensitivities to ambient density suggest that for ambient densities less than 2.4 kg/m3, aerodynamic effects are likely suppressed, allowing the influence of turbulent-induced breakup to be isolated. In concert with the experimental measurements, we utilize three-dimensional, CFD Lagrangian-Eulerian spray simulations in CONVERGE to evaluate the details of the predicted spray structure. In particular, we compare measured and predicted sensitivities of the SMD distribution to changes in injection and ambient conditions from three different atomization models, namely Kelvin Helmholtz (KH), KH Aerodynamics Cavitation Turbulence (KH-ACT), and the newly developed KH-Faeth hybrid model. While none of the existing hybrid spray models were able to replicate the experimentally observed sensitivities, it was found that the scales characterizing the KH-Faeth model show promise of capturing the experimentally observed trends if the effects of secondary droplet breakup are neglected. These results inform recommendations for future experiments and computational studies that can guide the development of an improved spray breakup model.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Multigrid Reduction in Time for Nonlinear Parabolic Problems

The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

ExaCA: A performance portable exascale cellular automata application for alloy solidification modeling

Modeling the as-solidified grain structures that form during alloy processing is a critical component in understanding process-property relationships, particularly for additive manufacturing (AM) where grain structure is very sensitive to processing conditions. While cellular automata (CA)-based models have proven able to predict aspects of microstructure for several alloys and AM process conditions, long run times and large resource sets required limit the utility and the problem size to which existing CA models can be applied. As part of the ExaAM project, an initiative within the Exascale Computing Project (ECP) to develop, test, and optimize an exascale-capable coupled and self-consistent model of AM parts, we developed ExaCA (https://github.com/LLNL/ExaCA) for the liquid–solid phase transformation in the wake of AM melt pools. The CA-based code is parallelized using MPI and the Kokkos programming model, the latter enabling simulation on both CPUs and GPUs within a single-source implementation. Here, we detail the steps taken to transform a baseline, MPI-based CA code into one that is performant on CPUs and GPUs. Performance testing of ExaCA on Summit (a pre-exascale machine at Oak Ridge National Laboratory) was used to quantify CPU–GPU speedup comparing with equal numbers of nodes. Testing showed comparable CPU performance to the MPI-only CA code and a 5-20x speedup when running AM-based test problems using GPUs. The improved performance of CA through GPU utilization and the performance portable nature of ExaCA will enable accurate part-scale modeling by harnessing the power of current and future generations of high performance computing resources. Future work will include improving the strong scaling of ExaCA on GPUs by reducing load imbalance associated with the locality of the problem, and continuing performance optimization across exascale hardware.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Current-Induced Skyrmion Generation through Morphological Thermal Transitions in Chiral Ferromagnetic Heterostructures

Magnetic skyrmions promise breakthroughs in future memory and computing devices due to their inherent stability and small size. Their creation and current driven motion have been recently observed at room temperature, but the key mechanisms of their formation are not yet well-understood. Here it is shown that in heavy metal/ferromagnet heterostructures, pulsed currents can drive morphological transitions between labyrinth-like, stripe-like, and skyrmionic states. Using high-resolution X-ray microscopy, the spin texture evolution with temperature and magnetic field is imaged and it is demonstrated that with transient Joule heating, topological charges can be injected into the system, driving it across the stripe-skyrmion boundary. The observations are explained through atomistic spin dynamic and micromagnetic simulations that reveal a crossover to a global skyrmionic ground state above a threshold magnetic field, which is found to decrease with increasing temperature. It is demonstrated how by tuning the phase stability, one can reliably generate skyrmions by short current pulses and stabilize them at zero field, providing new means to create and manipulate spin textures in engineered chiral ferromagnets.

36 MATERIALS SCIENCE↗
DOE OSTI2021

FPGA-based HPC accelerators: An evaluation on performance and energy efficiency

Hardware specialization is a promising direction for the future of digital computing. Reconfigurable technologies enable hardware specialization with modest non-recurring engineering cost, but their performance and energy efficiency compared to state-of-the-art processor architectures remain an open question. In this article, we use FPGAs to evaluate the benefits of building specialized hardware for numerical kernels found in scientific applications. In order to properly evaluate performance, we not only compare Intel Arria 10 and Xilinx U280 performance against Intel Xeon, Intel Xeon Phi, and NVIDIA V100 GPUs, but we also extend the Empirical Roofline Toolkit (ERT) to FPGAs in order to assess our results in terms of the Roofline model. We show design optimization and tuning techniques for peak FPGA performance at reasonable hardware usage and power consumption. As FPGA peak performance is known to be far less than that of a GPU, we also benchmark the energy efficiency of each platform for the scientific kernels comparing against microbenchmark and technological limits. Results show that while FPGAs struggle to compete in absolute terms with GPUs on memory- and compute-intensive kernels, they require far less power and can deliver nearly the same energy efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

One-loop matching for quark dipole operators in a gradient-flow scheme

The quark chromoelectric dipole (qCEDM) operator is a CP-violating operator describing, at hadronic energies, beyond-the-standard-model contributions to the electric dipole moment of particles with nonzero spin. In this paper we define renormalized dipole operators in a regularization-independent scheme using the gradient flow, and we perform the matching at one loop in perturbation theory to renormalized operators of the same and lower dimension in the more familiar MS scheme. We also determine the matching coefficients for the quark chromo-magnetic dipole operator (qCMDM), which contributes for example to matrix elements relevant to CP-violating and CP-conserving kaon decays. The calculation provides a basis for future lattice QCD computations of hadronic matrix elements of the qCEDM and qCMDM operators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Higgs decays at NLO in the SMEFT

The calculation of precise predictions for Higgs decays is a necessary ingredient for determining Higgs properties at the LHC and future colliders. We compute all two- and three- body Higgs decays at next-to-leading order (NLO) in both QCD and electroweak interactions using the dimension-6 Standard Model Effective Field Theory (SMEFT). Results for four-body Higgs decays that are accurate to NLO QCD/electroweak order in the SMEFT are obtained using the narrow width approximation. Our results are contained in a flexible Monte Carlo program, NEWiSH, that is publicly available and we illustrate the impact of the NLO electroweak corrections for HL-LHC, Tera-Z, and Higgstrahlung projections.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

A novel proposal for all optical half-subtractor based on photonic crystals

Optical logic devices are the inevitable need for the future all optical computing and data processing. In this paper we are going to design and propose an all optical half subtractor using photonic crystal structure. The proposed structure will be realized using both threshold switching and beam interference. Finite difference time domain method used for analyzing the proposed structure. The simulation results show that the contrast ratio for D and B ports are 8 dB and 12 dB respectively. Also the maximum the maximum rise and fall times are 1 ps and 0.6 ps respectively.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗