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,315 records · Page 73

Rapidity Gap Events for Squark Pair Production at the LHC

The exchange of electroweak gauginos in the t- or u-channel allows squark pair production at hadron colliders without color exchange between the squarks. This can give rise to events where little or no energy is deposited in the detector between the squark decay products. We discuss the potential for detection of such rapidity gap events at the Large Hadron Collider (LHC). We present an analysis with full event simulation using PYTHIA as well as Herwig++, but without detector simulation. We analyze the transverse energy deposited between the jets from squark decay, as well as the probability of finding a third jet in between the two hardest jets. For the mSUGRA benchmark point SPS1a we find statistically significant evidence for a color singlet exchange contribution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Isochronous (CW) Non-Scaling FFAGs: Design and Simulation

The drive for higher beam power, high duty cycle, and reliable beams at reasonable cost has focused international attention and design effort on fixed field accelerators, notably Fixed-Field Alternating Gradient accelerators (FFAGs). High-intensity GeV proton drivers encounter duty cycle and space-charge limits in the synchrotron and machine size concerns in the weaker-focusing cyclotrons. A 10-20 MW proton driver is challenging, if even technically feasible, with conventional accelerators--with the possible exception of a SRF linac, which has a large associated cost and footprint. Recently, the concept of isochronous orbits has been explored and developed for nonscaling FFAGs using powerful new methodologies in FFAG accelerator design and simulation. The property of isochronous orbits enables the simplicity of fixed RF and, by tailoring a nonlinear radial field profile, the FFAG can remain isochronous beyond the energy reach of cyclotrons, well into the relativistic regime. With isochronous orbits, the machine proposed here has the high average current advantage and duty cycle of the cyclotron in combination with the strong focusing, smaller losses, and energy variability that are more typical of the synchrotron. This paper reports on these new advances in FFAG accelerator technology and presents advanced modeling tools for fixed-field accelerators unique to the code COSY INFINITY.

43 PARTICLE ACCELERATORS↗

Analysis and mitigation of parasitic resistance effects for analog in-memory neural network acceleration

To support the increasing demands for efficient deep neural network processing, accelerators based on analog in-memory computation of matrix multiplication have recently gained significant attention for reducing the energy of neural network inference. However, analog processing within memory arrays must contend with the issue of parasitic voltage drops across the metal interconnects, which distort the results of the computation and limit the array size. This work analyzes how parasitic resistance affects the end-to-end inference accuracy of state-of-the-art convolutional neural networks, and comprehensively studies how various design decisions at the device, circuit, architecture, and algorithm levels affect the system's sensitivity to parasitic resistance effects. Here, a set of guidelines are provided for how to design analog accelerator hardware that is intrinsically robust to parasitic resistance, without any explicit compensation or re-training of the network parameters.

97 MATHEMATICS AND COMPUTING↗

A parallel in energy Krylov solution algorithm for the variational nodal method

To reduce the computational expense caused by the large number of energy groups in thermal and fast reactor calculations, we researched using parallelization in energy (i.e. group) of the multi-group response matrix equations derived from the Variational Nodal Method. This study focuses on solving steady-state eigenvalue problems in diffusion theory that are typically needed for depletion and reactivity coefficient calculations. To examine serial and parallel performance, GMRES, a Krylov algorithm, is applied to the multi-group system of equations at each fission source iteration. We also study the impact of using Wielandt acceleration on the eigenvalue/eigenvector problem. Numerical results based on a 72 group thermal and a 216 group fast reactor core problems are obtained for both serial and parallel calculations. The results show reduced CPU times when using GMRES and Wielandt acceleration in both serial and parallel calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Brookhaven Lab Hosts Hackathon Focused on Graphics Processing Units (GPUs)

For five days in June 2017, Brookhaven Lab’s Computational Science Initiative hosted “Brookathon”—a programming workshop where teams of researchers, students, and software developers worked with mentors to accelerate scientific applications on GPUs for high-performance computing.

97 MATHEMATICS AND COMPUTING↗

A system for monitoring the radiation effects of a proton linear accelerator

The system for real-time monitoring of radioactivity of a high-current proton linear accelerator detects secondary neutron emission from proton beam losses in transport channels and measures the activity of radionuclides in gas and aerosol emissions and the radiation background in the environment affected by a linear accelerator. The data provided by gamma, beta, and neutron detectors are transferred over a computer network to the central server. The system allows one to monitor proton beam losses, the activity of gas and aerosol emissions, and the radiation emission level of a linear accelerator in operation.

07 ISOTOPE AND RADIATION SOURCES↗

HipBone: A performance-portable graphics processing unit-accelerated C++ version of the NekBone benchmark

We present hipBone, an open-source performance-portable proxy application for the Nek5000 (and NekRS) computational fluid dynamics applications. HipBone is a fully GPU-accelerated C++ implementation of the original NekBone CPU proxy application with several novel algorithmic and implementation improvements which optimize its performance on modern fine-grain parallel GPU accelerators. Our optimizations include a conversion to store the degrees of freedom of the problem in assembled form in order to reduce the amount of data moved during the main iteration and a portable implementation of the main Poisson operator kernel. We demonstrate near-roofline performance of the operator kernel on three different modern GPU accelerators from two different vendors. We present a novel algorithm for splitting the application of the Poisson operator on GPUs which aggressively hides MPI communication required for both halo exchange and assembly. Our implementation of nearest-neighbor MPI communication then leverages several different routing algorithms and GPU-Direct RDMA capabilities, when available, which improves scalability of the benchmark. We demonstrate the performance of hipBone on three different clusters housed at Oak Ridge National Laboratory, namely, the Summit supercomputer and the Frontier early-access clusters, Spock and Crusher. Our tests demonstrate both portability across different clusters and very good scaling efficiency, especially on large problems.

Computer Science↗

Accelerator on a Chip

SLAC's Joel England explains how the same fabrication techniques used for silicon computer microchips allowed their team to create the new laser-driven particle accelerator chips. (SLAC Multimedia Communications)

43 PARTICLE ACCELERATORS↗

Machine-learning accelerated geometry optimization in molecular simulation

Geometry optimization is an important part of both computational materials and surface science because it is the path to finding ground state atomic structures and reaction pathways. These properties are used in the estimation of thermodynamic and kinetic properties of molecular and crystal structures. This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (DFT), which are computationally expensive and which limit the speed of the optimization algorithms. It would be highly advantageous to accelerate this process because then one could do either the same amount of work in less time or more work in the same time. Here, we provide a neural network (NN) ensemble based active learning method to accelerate the local geometry optimization for multiple configurations simultaneously. We illustrate the acceleration on several case studies including bare metal surfaces, surfaces with adsorbates, and nudged elastic band for two reactions. In all cases, the accelerated method requires fewer DFT calculations than the standard method. In addition, we provide an Atomic Simulation Environment (ASE)-optimizer Python package to make the usage of the NN ensemble active learning for geometry optimization easier.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Direct evidence of microstructure dependence of magnetic flux trapping in niobium

Abstract Elemental type-II superconducting niobium is the material of choice for superconducting radiofrequency cavities used in modern particle accelerators, light sources, detectors, sensors, and quantum computing architecture. An essential challenge to increasing energy efficiency in rf applications is the power dissipation due to residual magnetic field that is trapped during the cool down process due to incomplete magnetic field expulsion. New SRF cavity processing recipes that use surface doping techniques have significantly increased their cryogenic efficiency. However, the performance of SRF Nb accelerators still shows vulnerability to a trapped magnetic field. In this manuscript, we report the observation of a direct link between flux trapping and incomplete flux expulsion with spatial variations in microstructure within the niobium. Fine-grain recrystallized microstructure with an average grain size of 10–50 µm leads to flux trapping even with a lack of dislocation structures in grain interiors. Larger grain sizes beyond 100–400 µm do not lead to preferential flux trapping, as observed directly by magneto-optical imaging. While local magnetic flux variations imaged by magneto-optics provide clarity on a microstructure level, bulk variations are also indicated by variations in pinning force curves with sequential heat treatment studies. The key results indicate that complete control of the niobium microstructure will help produce higher performance superconducting resonators with reduced rf losses 1 related to the magnetic flux trapping.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accelerating Monte Carlo simulations of photon transport in a voxelized geometry using a massively parallel graphics processing unit

Purpose: It is a known fact that Monte Carlo simulations of radiation transport are computationally intensive and may require long computing times. The authors introduce a new paradigm for the acceleration of Monte Carlo simulations: The use of a graphics processing unit (GPU) as the main computing device instead of a central processing unit (CPU). Methods: A GPU-based Monte Carlo code that simulates photon transport in a voxelized geometry with the accurate physics models from PENELOPE has been developed using the CUDA programming model (NVIDIA Corporation, Santa Clara, CA). Results: An outline of the new code and a sample x-ray imaging simulation with an anthropomorphic phantom are presented. A remarkable 27-fold speed up factor was obtained using a GPU compared to a single core CPU. Conclusions: The reported results show that GPUs are currently a good alternative to CPUs for the simulation of radiation transport. Since the performance of GPUs is currently increasing at a faster pace than that of CPUs, the advantages of GPU-based software are likely to be more pronounced in the future.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Low Power Hardware-In-The-Loop Neuromorphic Training Accelerator

The training process for spiking neural networks can be very computationally intensive. Approaches such as evolutionary algorithms may require evaluating thousands or millions of candidate solutions. In this work, we propose using neuromorphic cores implemented on a Xilinx Zynq system on chip to accelerate and improve the energy efficiency of the evaluation step of an evolutionary training approach. We demonstrate this can significantly reduce the required energy to evolve a network with some cases showing greater than 10 times improvement as compared to a CPU-only system.

Mitchell, Parker↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Longitudinal bunch monitoring at the Fermilab Tevatron and Main Injector synchrotrons

The measurement of the longitudinal behavior of the accelerated particle beams at Fermilab is crucial to the optimization and control of the beam and the maximizing of the integrated luminosity for the particle physics experiments. Longitudinal measurements in the Tevatron and Main Injector synchrotrons are based on the analysis of signals from resistive wall current monitors. This study describes the signal processing performed by a 2 GHz-bandwidth oscilloscope together with a computer running a LabVIEW program which calculates the longitudinal beam parameters.

43 PARTICLE ACCELERATORS↗

Automated and Accelerated Continuum Model Development for Electrochemical Systems (Abbreviated Report)

Despite the availability of computational resources and advancements in numerical computing capabilities, the multiscale models core to understanding, predicting the behaviors of, and designing energy and environmental systems involving porous media are still 1.) developed through by-hand derivations and 2.) limited by many methodological assumptions employed during model derivation. As a result, the advancement of effective media models for engineering DOE mission-critical systems (e.g., batteries, flow batteries, electrolyzers, geothermal systems, subsurface chemical storage systems, etc.) is slow (i.e., it takes years for models to traverse from stages of “development” to “practical utilization”), hindering our ability to effectively optimize such systems and stay at the cutting-edge of the energy frontier. In this work, we aimed to address these limitations by 1.) automating and accelerating multiscale model derivation via symbolic computing and 2.) develop a novel multiscale modeling methodology for flow and transport through porous media that avoids the typical assumptions hindering previous models. As a result of our efforts, we 1.) developed a hybrid symbolic-numeric code called Fouriera for fully-automating the implementation of multiphysical and phase-field models via the Fourier spectral method for materials science research, and 2.) advanced a multiscale modeling methodology called The Method of Finite Averages that rigorously predicts the behaviors of flow and transport through heterogeneous porous media under the influence of non-local effects and strong advection. Ultimately, these deliverables provide strong foundations from which further efforts can advance multiscale modeling tools and capabilities that do not intrinsically rely on 1.) the speed and mathematical capabilities of humans, nor 2.) the methodological assumptions limiting current models.

36 MATERIALS SCIENCE↗

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Purpose: The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT. Methods: Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units. Results: The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min. Conclusions: The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

60 APPLIED LIFE SCIENCES↗

CoSim: A Simulator for Co-Scheduling of Batch and On-Demand Jobs in HPC Datacenters

The increasing scale and complexity of scientific applications are rapidly transforming the ecosystem of tools, methods, and workflows adopted by the high-performance computing (HPC) community. Big data analytics and deep learning are gaining traction as essential components in this ecosystem in a variety of scenarios, such as, steering of experimental instruments , acceleration of high-fidelity simulations through surrogate computations, and guided ensemble searches. In this context, the batch job model traditionally adopted by the supercomputing in-frastructures needs to be complemented with support to schedule opportunistic on-demand analytics jobs, leading to the problem of efficient preemption of batch jobs with minimum loss of progress. In this paper, we design and implement a simulator, CoSim, that enables on-the-fly analysis of the trade-offs arising between delaying the start of opportunistic on-demand jobs, which leads to longer analytics latency, and loss of progress due to preemption of batch jobs, which is necessary to make room for on-demand jobs. To this end, we propose an algorithm based on dynamic programming with predictable performance and scalability that enables supercomputing infrastructure schedulers to analyze the aforementioned trade-off and take decisions in near real-time. Compared with other state-of-art approaches using traces of the Theta pre-Exascale machine, our approach is capable of finding the optimal solution, while achieving high performance and scalability.

batch job preemption↗

Scientific Challenges for Understanding the Quantum Universe

A workshop titled "Scientific Challenges for Understanding the Quantum Universe" was held December 9-11, 2008, at the Kavli Institute for Particle Astrophysics and Cosmology at the Stanford Linear Accelerator Center-National Accelerator Laboratory. The primary purpose of the meeting was to examine how computing at the extreme scale can contribute to meeting forefront scientific challenges in particle physics, particle astrophysics and cosmology. The workshop was organized around five research areas with associated panels. Three of these, "High Energy Theoretical Physics," "Accelerator Simulation," and "Experimental Particle Physics," addressed research of the Office of High Energy Physics’ Energy and Intensity Frontiers, while the"Cosmology and Astrophysics Simulation" and "Astrophysics Data Handling, Archiving, and Mining" panels were associated with the Cosmic Frontier.

43 PARTICLE ACCELERATORS↗