Search NASA⌕ Search

SEARCH · Search NASA

Results for “Accelerators, 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,783 records · Page 99

Characteristics of 3D turbulent jets in crossflow

Three dimensional turbulent jets in crossflow at low to medium jet-to-crossflow velocity ratios are computed with a finite volume numerical procedure which utilizes a second-moment closure model to approximate the Reynolds stresses. A multigrid method is used to accelerate the convergence rate of the procedure. Comparison of the computations to measured data show good qualitative agreement. All trends are correctly predicted, though there is some uncertainty on the height of penetration of the jet. The evolution of the vorticity field is used to explore the jet-crossflow interaction.

Demuren, A. O.↗

Characteristics of 3D turbulent jets in crossflow

Three dimensional turbulent jets in crossflow at low to medium jet-to-crossflow velocity ratios are computed with a finite volume numerical procedure which utilizes a second-moment closure model to approximate the Reynolds stresses. A multigrid method is used to accelerate the convergence rate of the procedure. Comparison of the computations to measured data show good qualitative agreement. All trends are correctly predicted, though there is some uncertainty on the height of penetration of the jet. The evolution of the vorticity field is used to explore the jet-crossflow interaction.

Demuren, A. O.↗

Characteristics of three-dimensional turbulent jets in crossflow

Three-dimensional turbulent jets in crossflow at low to medium jet-to-crossflow velocity ratios are computed with a finite volume numerical procedure which utilizes a second-moment closure model to approximate the Reynolds stresses. A multigrid method is used to accelerate the convergence rate of the procedure. Comparison of the computations to measured data show good qualitative agreement. All trends are correctly predicted, though there is some uncertainty on the height of penetration of the jet. The evolution of the vorticity field is used to explore the jet-crossflow interaction.

Demuren, A. O.↗

Dynamic Catalysis Fundamentals: I. Fast calculation of limit cycles in dynamic catalysis

Dynamic catalysis—the forced oscillation of catalytic reaction coordinate potential energy surfaces (PES)—has recently emerged as a promising method for the acceleration of heterogeneously-catalyzed reactions. Theoretical study of enhancement of rates and supra-equilibrium product yield via dynamic catalysis has, to-date, been severely limited by onerous computational demands of forward integration of stiff, coupled ordinary differential equations (ODEs) that are necessary to quantitatively describe periodic cycling between PESs. Here, we establish a new approach that reduces, by ≳108×, the computational cost of finding the time-averaged rate at dynamic steady state (i.e. the limit cycle for linear and nonlinear systems of kinetic equations). Our developments are motivated by and conceived from physical and mathematical insight drawn from examination of a simple, didactic case study for which closed-form solutions of rate enhancement are derived in explicit terms of periods of oscillation and elementary step rate constants. Generalization of such closed-form solutions to more complex catalytic systems is achieved by introducing a periodic boundary condition requiring the dynamic steady state solution to have the same periodicity as the kinetic oscillations and solving the corresponding differential equations by linear algebra or Newton-Raphson-based approaches. The methodology is well-suited to extension to non-linear systems for which we detail the potential for multiple solutions or solutions with different periodicities. For linear and non-linear systems alike, the acute decrement in computational expense enables rapid optimization of oscillation waveforms and, consequently, accelerates understanding of the key catalyst properties that enable maximization of reaction rates, conversions, and selectivities during dynamic catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hardware-Accelerated Ray Tracing of CAD-Based Geometry for Monte Carlo Radiation Transport

Monte Carlo radiation transport (MCRT) methods have been used to simulate radiation environments for many decades by tracking individual particles through a model to accumulate statistical information. MCRT geometry is historically formed using the constructive solid geometry (CSG). Recently, significant work has been performed to support simulations using computer-aided design (CAD)-based tessellated surfaces to support highly complex geometries. Ray tracing acceleration data structures from the rendering and visualization community are applied to accelerate particle tracking in CAD-based models. Despite these efforts, CSG representations provide the superior performance in surface intersection operations during particle flight. Concurrently, pseudo Monte Carlo methods have become prevalent in rendering applications to support more realistic models for scattering media, motivating innovations that are advantageous for MCRT simulations. Finally, the authors’ work extends these innovations by employing Intel’s Embree ray tracing kernel within a geometry toolkit for Monte Carlo to improve the simulation performance using CAD-based models by factors of 1.5 to 2.

42 ENGINEERING↗

Self-organizing map (SOM) of space acceleration measurement system (SAMS) data

In this paper, space acceleration measurement system (SAMS) data have been classified using self-organizing map (SOM) networks without any supervision; i.e., no a priori knowledge is assumed regarding input patterns belonging to a certain class. Input patterns are created on the basis of power spectral densities of SAMS data. Results for SAMS data from STS-50 and STS-57 missions are presented. Following issues are discussed in details: impact of number of neurons, global ordering of SOM weight vectors, effectiveness of a SOM in data classification, and effects of shifting time windows in the generation of input patterns. The concept of 'cascade of SOM networks' is also developed and tested. It has been found that a SOM network can successfully classify SAMS data obtained during STS-50 and STS-57 missions.

STS-57 Shuttle Project↗

Toward laser ablation Accelerator Mass Spectrometry of actinides

A project to measure neutron capture cross sections of a number of actinides in a reactor environment by Accelerator Mass Spectrometry (AMS) at the ATLAS facility of Argonne National Laboratory is underway. This project will require the precise and accurate measurement of produced actinide isotopes in many (>30) samples irradiated in the Advanced Test Reactor at Idaho National Laboratory with neutron fluxes having different energy distributions. The AMS technique at ATLAS is based on production of highlycharged positive ions in an electron cyclotron resonance (ECR) ion source followed by acceleration in the ATLAS linac and mass-to-charge (m/q) measurement at the focus of the Fragment Mass Analyzer. Laser ablation was selected as the method of feeding the actinide material into the ion source because we expect it will have higher efficiency and lower chamber contamination than either the oven or sputtering techniques, because of a much narrower angular distribution of emitted material. In addition, a new multi-sample holder/changer to allow quick change between samples and a computer-controlled routine allowing fast tuning of the accelerator for different beams, are being developed. An initial test run studying backgrounds, detector response, and accelerator scaling repeatability was conducted in December 2010. The project design, schedule, and results of the initial test run to study backgrounds are discussed.

99 GENERAL AND MISCELLANEOUS↗

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data parallelism latent in recursive, task- parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.

Recursive Programs, task parallelism, vectorizatio↗

Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\)

Here, this work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in H(div). The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation–histopolation basis, efficient matrix-free preconditioners can be constructed for the (1, 1)-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the “crooked pipe” grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

97 MATHEMATICS AND COMPUTING↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

Software for Use with Optoelectronic Measuring Tool

A computer program has been written to facilitate and accelerate the process of measurement by use of the apparatus described in "Optoelectronic Tool Adds Scale Marks to Photographic Images" (KSC-12201). The tool contains four laser diodes that generate parallel beams of light spaced apart at a known distance. The beams of light are used to project bright spots that serve as scale marks that become incorporated into photographic images (including film and electronic images). The sizes of objects depicted in the images can readily be measured by reference to the scale marks. The computer program is applicable to a scene that contains the laser spots and that has been imaged in a square pixel format that can be imported into a graphical user interface (GUI) generated by the program. It is assumed that the laser spots and the distance(s) to be measured all lie in the same plane and that the plane is perpendicular to the line of sight of the camera used to record the image

Ballard, Kim C.↗

Evaluation of a trajectory command concept for manual control of carrier approaches and landings

A novel trajectory control system concept was implemented to provide manual control of a conventional jet aircraft. This concept, called Total Aircraft Flight Control System (TAFCOS), utilizes an inverse model of the aerodynamic and propulsion characteristics and employs feedforward control to provide the required acceleration command. The concept requires on-board digital computations which can easily be handled by a modern airborne computer. The system was studied in a piloted simulation of the carrier approach and landing task with primarily visual flight and guidance cues. The principal modes of vertical flight-path control investigated were vertical velocity command and vertical acceleration command. The study included manual carrier approaches with and without moderate ship motion and associated air disturbances, and tests of the effects of discrete gusts. Manual control of flight path through this new concept was shown to be feasible as an addition to an automatic control system and to have potential as an improved mode of control over conventional control for the carrier approach task.

Mcneill, W. E.↗

TomoBank: a tomographic data repository for computational x-ray science

There is a widening gap between the fast advancement of computational methods for tomographic reconstruction and their successful implementation in production software at various synchrotron facilities. This is due in part to the lack of readily available instrument datasets and phantoms representative of real materials for validation and comparison of new numerical methods. Recent advancements in detector technology made sub-second and multi-energy tomographic data collection possible [1], but also increased the demand to develop new reconstruction methods able to handle in-situ [2] and dynamic systems [3] that can be quickly incorporated in beamline production software [4]. The X-ray Tomography Data Bank, tomoBank, provides a repository of experimental and simulated datasets with the aim to foster collaboration among computational scientists, beamline scientists, and experimentalists and to accelerate the development and implementation of tomographic reconstruction methods for synchrotron facility production software by providing easy access to challenging dataset and their descriptors.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Probability density function method for variable-density pressure-gradient-driven turbulence and mixing

Probability density function (PDF) methods are extended to variable-density pressure-gradient-driven turbulence. We apply the new method to compute the joint PDF of density and velocity in a non-premixed binary mixture of different-density molecularly mixing fluids under gravity. The full time-evolution of the joint PDF is captured in the highly non-equilibrium flow: starting from a quiescent state, transitioning to fully developed turbulence and finally dissipated by molecular diffusion. High-Atwood-number effects (as distinguished from the Boussinesq case) are accounted for: both hydrodynamic turbulence and material mixing are treated at arbitrary density ratios, with the specific volume, mass flux and all their correlations in closed form. An extension of the generalized Langevin model, originally developed for the Lagrangian fluid particle velocity in constant-density shear-driven turbulence, is constructed for variable-density pressure-gradient-driven flows. The persistent small-scale anisotropy, a fundamentally 'non-Kolmogorovian' feature of flows under external acceleration forces, is captured by a tensorial diffusion term based on the external body force. The material mixing model for the fluid density, an active scalar, is developed based on the beta distribution. The beta-PDF is shown to be capable of capturing the mixing asymmetry and that it can accurately represent the density through transition, in fully developed turbulence and in the decay process. The joint model for hydrodynamics and active material mixing yields a time-accurate evolution of the turbulent kinetic energy and Reynolds stress anisotropy without resorting to gradient diffusion hypotheses, and represents the mixing state by the density PDF itself, eliminating the need for dubious mixing measures. Direct numerical simulations of the homogeneous Rayleigh-Taylor instability are used for model validation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

GPU accelerated flow solver for direct numerical simulation of turbulent flows

Graphical processing units (GPUs), characterized by significant computing performance, are nowadays very appealing for the solution of computationally demanding tasks in a wide variety of scientific applications. However, to run on GPUs, existing codes need to be ported and optimized, a procedure which is not yet standardized and may require non trivial efforts, even to high-performance computing specialists. In the present paper we accurately describe the porting to CUDA (Compute Unified Device Architecture) of a finite-difference compressible Navier–Stokes solver, suitable for direct numerical simulation (DNS) of turbulent flows. Porting and validation processes are illustrated in detail, with emphasis on computational strategies and techniques that can be applied to overcome typical bottlenecks arising from the porting of common computational fluid dynamics solvers. We demonstrate that a careful optimization work is crucial to get the highest performance from GPU accelerators. The results show that the overall speedup of one NVIDIA Tesla S2070 GPU is approximately 22 compared with one AMD Opteron 2352 Barcelona chip and 11 compared with one Intel Xeon X5650 Westmere core. The potential of GPU devices in the simulation of unsteady three-dimensional turbulent flows is proved by performing a DNS of a spatially evolving compressible mixing layer.

97 MATHEMATICS AND COMPUTING↗

CALCULATING POINT-CHARGE WAKEFIELDS FROM FINITE LENGTH BUNCH WAKE-POTENTIALS

Starting from analytical properties of high frequency geometric impedance we show how one can accurately calculate short bunch wake-potentials (and even point-charge wakefields) from time domain calculations performed with a much longer bunch. In many practical instances this drastically reduces the need for computer resources, speeds up the calculations, and improves their accuracy. To illustrate this method we give examples for 2D accelerator structures of various complexities. We describe preliminary results of a new method that allows us to accurately obtain longitudinal wakefields of short bunches by adding a long-bunch result from an EM solver and a singular analytical wake model. In the future this work will be generalized to 3D geometries as well. Similarly, the method should be equally applicable to the calculations of transverse wakefields. Periodic structures with a significant number of periods (2 {ge} a{sup 2}/{sigma}L, where L is the period length) have not been considered so far. They have asymptotic wakefields that differ from the examples described above. We believe this method is applicable to such geometries as well, as long as correct asymptotic solutions are used.

43 PARTICLE ACCELERATORS↗

Analog Systems for Edge Optimization

Over the past decade, analog computing has the subject of substantial research interest providing a path toward improved computational efficiency in the post-Dennard era. Analog matrix vector multiplication (MVM) accelerators provide a popular approach given the ubiquity of MVM operations in numerous applications. However, historically analog computing systems can struggle with applications requiring high precision due to the inherent susceptibility of these systems to analog non-idealities. Therefore, prior work on analog systems has focused either on applications known to be tolerant of limited precision (e.g., neural network inference), or using expensive techniques to emulate high-precision using many analog MVM operations. In this work, we propose an alternative approach. Motivated by recent advances in inexact nonlinear solvers and optimizers, we explore the potential of co-designing optimization algorithms which can take full advantage of the fundamentally inexact analog MVM operations. To enable these co-designed algorithms we also develop a general mathematical theory of the precision and energy efficiency of analog operations, and a new system architecture for tightly-coupled analog and digital computation. Finally, we examine the applicability of analog computing to a wider class of symmetric positive definite systems and find potential in using analog operations as a sparse approximate inverse preconditioner. With these core innovations, this project provides a path toward effectively implementing optimization algorithms on power-constrained autonomous and semi-autonomous systems.

97 MATHEMATICS AND COMPUTING↗

GEANT4 Application for the Simulation of the Head of a Siemens Primus Linac

The Monte Carlo simulation of the head of a Siemens Primus Linac used at Virgen Macarena Hospital (Sevilla, Spain) has been performed using the code GEANT4, version 9.2. In this work, the main features of the application built by our group are presented. They are mainly focused in the optimization of the performance of the simulation. The geometry, including the water phantom, has been entirely wrapped by a shielding volume which discards all the particles escaping far away through its walls. With this, a factor of four in the time spent by the simulation can be saved. An interface to read and write phase-space files in IAEA format has been also developed to save CPU time in our simulations. Finally, some calculations of the dose absorption in the water phantom have been done and compared with the results given by EGSnrc and with experimental data obtained for the calibration of the machine.

43 PARTICLE ACCELERATORS↗