Engineering Papers⌕ Search

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.

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

At least 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗
DOE OSTI2021

Bolt: A Fast Solver for Kinetic Theories Using a High-Resolution Constrained Transport Scheme [Slides]

Our understanding of collisionless and semi-collisional plasmas in the nonlinear regime is limited by the expense of computing solutions numerically. Bolt is a fast, GPU-accelerated code for rapidly computing such solutions with accurate transport and an approximate collision operator. Such calculations are relevant to both problems in astrophysics, such as heat conduction and magnetic reconnection in accretion disks around black holes, and also to programmatic interests at LANL. The bolt code paper, demonstrating accuracy via a suite of test problems calculated on kodiak, is currently in preparation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Clustering in massive neutrino cosmologies via Eulerian Perturbation Theory

We introduce an Eulerian Perturbation Theory to study the clustering of tracers for cosmologies in the presence of massive neutrinos. Our approach is based on mapping recently-obtained Lagrangian Perturbation Theory results to the Eulerian framework. We add Effective Field Theory counterterms, IR-resummations and a biasing scheme to compute the one-loop redshift-space power spectrum. To assess our predictions, we compare the power spectrum multipoles against synthetic halo catalogues from the QUIJOTE simulations, finding excellent agreement on scales k ≲ 0.25 h Mpc-1. One can obtain the same fitting accuracy using higher wave-numbers, but then the theory fails to give a correct estimation of the linear bias parameter. We further discuss the implications for the tree-level bispectrum. Finally, calculating loop corrections is computationally costly, hence we derive an accurate approximation wherein we retain only the main features of the kernels, as produced by changes to the growth rate. As a result, we show how FFTLog methods can be used to further accelerate the loop computations with these reduced kernels.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Analog architectures for neural network acceleration based on non-volatile memory

Analog hardware accelerators, which perform computation within a dense memory array, have the potential to overcome the major bottlenecks faced by digital hardware for data-heavy workloads such as deep learning. Exploiting the intrinsic computational advantages of memory arrays, however, has proven to be challenging principally due to the overhead imposed by the peripheral circuitry and due to the non-ideal properties of memory devices that play the role of the synapse. We review the existing implementations of these accelerators for deep supervised learning, organizing our discussion around the different levels of the accelerator design hierarchy, with an emphasis on circuits and architecture. We explore and consolidate the various approaches that have been proposed to address the critical challenges faced by analog accelerators, for both neural network inference and training, and highlight the key design trade-offs underlying these techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

First principles reaction discovery: from the Schrodinger equation to experimental prediction for methane pyrolysis

Our recent success in exploiting graphical processing units (GPUs) to accelerate quantum chemistry computations led to the development of the ab initio nanoreactor, a computational framework for automatic reaction discovery and kinetic model construction. In this work, we apply the ab initio nanoreactor to methane pyrolysis, from automatic reaction discovery to path refinement and kinetic modeling. Elementary reactions occurring during methane pyrolysis are revealed using GPU-accelerated ab initio molecular dynamics simulations. Subsequently, these reaction paths are refined at a higher level of theory with optimized reactant, product, and transition state geometries. Reaction rate coefficients are calculated by transition state theory based on the optimized reaction paths. The discovered reactions lead to a kinetic model with 53 species and 134 reactions, which is validated against experimental data and simulations using literature kinetic models. We highlight the advantage of leveraging local brute force and Monte Carlo sensitivity analysis approaches for efficient identification of important reactions. Both sensitivity approaches can further improve the accuracy of the methane pyrolysis kinetic model. The results in this work demonstrate the power of the ab initio nanoreactor framework for computationally affordable systematic reaction discovery and accurate kinetic modeling.

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

Development of a CPU/GPU portable software library for Lagrangian–Eulerian simulations of liquid sprays

The Lagrangian–Eulerian method is widely used for simulations of fuel sprays in turbulent combustion because of the advantage of treating the spray droplets as discrete points. One challenge of the Lagrangian–Eulerian method is the intense computational requirement when tracking the large number of Lagrangian particles needed for high fidelity. We have developed a performance-portable library, Grit, to track the Lagrangian particles in parallel on central processing unit (CPU) and graphics processing unit (GPU) accelerated high performance computing (HPC) architectures. Grit is a C++ library which employs Message Passing Interface (MPI) for distributed memory parallelism and Kokkos programming model for on-node shared memory parallelism with performance portability across different architectures of GPUs and multi-core/manycore CPUs. The parallel algorithms, key parallel kernels, and their performances on the pre-exascale supercomputer, Summit, are presented. Grit is coupled with a direct numerical simulation (DNS) solver, S3D, for multiphase simulations. A conservative formulation has been developed and implemented in Grit for phase coupling with thermodynamic consistency. The formulation separates the conservation of mass, momentum and energy from the physical models to prevent accidental violation of conservation laws due to inconsistent models. The formulation also enforces consistent definitions of enthalpies of the fuel for both phases and the latent heat of evaporation. Finally, simulations of turbulent particle-laden flow and the evaporation of dilute turbulent spray jet are performed to verify the software implementation, and to demonstrate the scalability of Grit for large-scale multiphase simulations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Convergence acceleration and shock fitting for transonic aerodynamics computations

Two problems in computational fluid dynamics are studied in the context of transonic small-disturbance theory - namely, (1) how to speed up the convergence for currently available iterative procedures, and (2) how a shock-fitting method may be adapted to existing relaxation procedures with minimal alterations in computer programming and storage requirements. The paper contributes to a clarification of error analyses for sequence transformations based on the power method (including also the nonlinear transforms of Aitken, Shanks, and Wilkinson), and to developing a cyclic iterative procedure applying the transformations. Examples testing the procedure for a model Dirichlet problem and for a transonic airfoil problem show that savings in computer time by a factor of three to five are generally possible, depending on accuracy requirements and the particular iterative procedure used.-

Hafez, M. M.↗
DOE OSTI2023

Accelerated pattern matching method on a quantum computing system

A method of determining a pattern in a sequence of bits using a quantum computing system includes setting a first register of a quantum processor in a superposition of a plurality of string index states, encoding a bit string in a second register of the quantum processor, encoding a bit pattern in a third register of the quantum processor, circularly shifting qubits of the second register conditioned on the first register, amplifying an amplitude of a state combined with the first register in which the circularly shifted qubits of the second register matches qubits of the third register, measuring an amplitude of the first register and determining a string index state of the plurality of string index states associated with the amplified state, and outputting, by use of a classical computer, a string index associated with the first register in the measured state.

NIROULA, Pradeep↗
DOE OSTI2025

Data-driven equation-free dynamics applied to many-protein complexes: The microtubule tip relaxation

Microtubules (MTs) constitute the largest components of the eukaryotic cytoskeleton and play crucial roles in various cellular processes, including mitosis and intracellular transport. The property allowing MTs to cater to such diverse roles is attributed to dynamic instability, which is coupled to the hydrolysis of GTP (guanosine-5'-triphosphate) to GDP (guanosine-5'-diphosphate) within the β-tubulin monomers. Understanding the equilibrium dynamics and the structural features of both GDP- and GTP-complexed MT tips, especially at an all-atom level, remains challenging for both experimental and computational methods because of their dynamic nature and the prohibitive computational demands of simulating large, many-protein systems. This study employs the “equation-free” multiscale computational method to accelerate the relaxation of all-atom simulations of MT tips toward their putative equilibrium conformation. Using large MT lattice systems (14 protofilaments × 8 heterodimers) comprising ~21-38 million atoms, we applied this multiscale approach to leapfrog through time and nearly double the computational efficiency in realizing relaxed all-atom conformations of GDP- and GTP-complexed MT tips. Commencing from an initial 4 μs unbiased all-atom simulation, we interleave coarse projective “equation-free” jumps with short bursts of all-atom molecular dynamics simulation to realize an additional effective simulation time of 1.875 μs. Our 5.875 μs of effective simulation trajectories for each system expose the subtle yet essential differences in the structures of MT tips as a function of whether β-tubulin monomer is complexed with GDP or GTP, as well as the lateral interactions within the MT tip, offering a refined understanding of features underlying MT dynamic instability. Furthermore, the approach presents a robust and generalizable framework for future explorations of large biomolecular systems at atomic resolution.

Wu, Jiangbo [University of Chicago, IL (United Sta↗
DOE OSTI2023

Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput

Undoubtedly, quantum computing offers valuable acceleration for solving intricate problems. One of the primary hurdles lies in executing large-scale quantum applications on backend machines. Qubit noise, among other factors, dramatically influences the execution process. Implementing effective scheduling techniques for quantum circuits is crucial for practical quantum computing and preventing excessive waiting times. The quantum realm is distinct from classical computing in terms of optimization, performance, utilization, and waiting periods. Consequently, the parameters and components of quantum circuit scheduling diverge from those of classical computing. This paper presents Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput, a straightforward yet effective scheduling framework and policy that enhances noise resilience, throughput, and the fidelity of quantum circuits. Drawing inspiration from classical methods, our scheduling approach incorporates additional constraints tailored for quantum logic. The outcome demonstrates a substantial improvement in fidelity and resource management, which is vital for real-world quantum applications.

Baheri, Betis↗
NASA NTRS1996

Gravitational acceleration as a cue for absolute size and distance?

When an object's motion is influenced by gravity, as in the rise and fall of a thrown ball, the vertical component of acceleration is roughly constant at 9.8 m/sec2. In principle, an observer could use this information to estimate the absolute size and distance of the object (Saxberg, 1987a; Watson, Banks, von Hofsten, & Royden, 1992). In five experiments, we examined people's ability to utilize the size and distance information provided by gravitational acceleration. Observers viewed computer simulations of an object rising and falling on a trajectory aligned with the gravitational vector. The simulated objects were balls of different diameters presented across a wide range of simulated distances. Observers were asked to identify the ball that was presented and to estimate its distance. The results showed that observers were much more sensitive to average velocity than to the gravitational acceleration pattern. Likewise, verticality of the motion and visibility of the trajectory's apex had negligible effects on the accuracy of size and distance judgments.

NASA Discipline Space Human Factors↗
DOE OSTI2022

Finding predictive models for singlet fission by machine learning

Singlet fission (SF), the conversion of one singlet exciton into two triplet excitons, could significantly enhance solar cell efficiency. Molecular crystals that undergo SF are scarce. Computational exploration may accelerate the discovery of SF materials. However, many-body perturbation theory (MBPT) calculations of the excitonic properties of molecular crystals are impractical for large-scale materials screening. We use the sure-independence-screening-and-sparsifying-operator (SISSO) machine-learning algorithm to generate computationally efficient models that can predict the MBPT thermodynamic driving force for SF for a dataset of 101 polycyclic aromatic hydrocarbons (PAH101). SISSO generates models by iteratively combining physical primary features. The best models are selected by linear regression with cross-validation. The SISSO models successfully predict the SF driving force with errors below 0.2 eV. Based on the cost, accuracy, and classification performance of SISSO models, we propose a hierarchical materials screening workflow. Three potential SF candidates are found in the PAH101 set.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Performance of a geometric deep learning pipeline for HL-LHC particle tracking

The Exa.TrkX project has applied geometric learning concepts such as metric learning and graph neural networks to HEP particle tracking. Exa.TrkX’s tracking pipeline groups detector measurements to form track candidates and filters them. The pipeline, originally developed using the TrackML dataset (a simulation of an LHC-inspired tracking detector), has been demonstrated on other detectors, including DUNE Liquid Argon TPC and CMS High-Granularity Calorimeter. This paper documents new developments needed to study the physics and computing performance of the Exa.TrkX pipeline on the full TrackML dataset, a first step towards validating the pipeline using ATLAS and CMS data. The pipeline achieves tracking efficiency and purity similar to production tracking algorithms. Crucially for future HEP applications, the pipeline benefits significantly from GPU acceleration, and its computational requirements scale close to linearly with the number of particles in the event.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Detector Simulation Challenges for Future Accelerator Experiments

Detector simulation is a key component for studies on prospective future high-energy colliders, the design, optimization, testing and operation of particle physics experiments, and the analysis of the data collected to perform physics measurements. This review starts from the current state of the art technology applied to detector simulation in high-energy physics and elaborates on the evolution of software tools developed to address the challenges posed by future accelerator programs beyond the HL-LHC era, into the 2030–2050 period. New accelerator, detector, and computing technologies set the stage for an exercise in how detector simulation will serve the needs of the high-energy physics programs of the mid 21st century, and its potential impact on other research domains.

43 PARTICLE ACCELERATORS↗
NASA NTRS1983

Implicit upwind methods for the compressible Navier-Stokes equations

A class of implicit upwind differencing methods for the compressible Navier-Stokes equations is described and applied. The methods are based on the use of local eigenvalues or wave speeds to control spatial differencing of inviscid terms and are aimed at increasing the level of accuracy and stability achievable in computation. Techniques for accelerating the rate of convergence to a steady state solution are also used. Applications to inviscid and viscous transonic flows are discussed and compared with other methods and experimental measurements. It is shown that accurate and efficient transonic airfoil calculations can be made on the Cray-l computer in less than 2 min.

Coakley, T. J.↗
DOE OSTI2022

Computational Methods to Characterize Panel Loading Conditions for Accelerated Testing

Panel cracking and degradation due to wind loading are known to have a detrimental effect on power output. Recreating these damaging conditions in a controlled experimental setting requires an understanding of the loads being generated at the panel surface as a function of both wind speed, wind direction, and panel orientation. To better understand these relationships, a computational fluid dynamics (CFD) simulation package was constructed using an open-source Python library for solving partial differential equations with the finite element method. This CFD package allows the simulated wind speed and panel orientation of a multi-panel array to be easily changed and provides the capability to measure the traction forces at discrete points along the sun-facing and ground-facing surface of an interior panel residing in the wake of one or more upstream panels. A parameter exploration was performed in which the panel angle was varied in even increments from -70 deg to 70 deg and the wind speed was varied from 2 to 30 m/s. During post processing, the measured traction along the panel surface was averaged spatially and interpreted as a time-varying signal, where further processing of this signal yielded the root mean square amplitude and a characteristic frequency associated with the loading. This study found that higher wind speeds are generally associated with increased amplitude of loading and that the panel orientation angle can significantly exacerbate or mitigate this loading. These outcomes are presented along with current work on higher-fidelity verification simulations and recommendations for performing accelerated experimental testing.

loading↗
DOE OSTI2023

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

In this report, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ exploits a cheaper Voronoi cell computation. Our design leverages asynchronous processing and message prioritization to accelerate convergence of distance computations, and harnesses vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance using real-world graphs with up to 128 billion edges and 512 compute nodes, and show the ability to find Steiner trees with up to one million seed vertices. Using 12 data instances, we present comparison with the state-of-the-art exact solver, SCIP-Jack, and two sequential 2-approximate algorithms. We empirically show that, on average, the total distance of the Steiner tree identified by our solution is 1.1290 times greater than the Steiner minimal tree – well within the theoretical approximation bound of 2.

97 MATHEMATICS AND COMPUTING↗