Search NASA⌕ Search

SEARCH · Search NASA

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 289 records · Page 16

Detecting Anomalous Computation with RNNs on GPU-Accelerated HPC Machines

This paper presents a workload classification framework that discriminates illicit computation from authorized workloads on GPU-accelerated HPC systems. As such systems become more and more powerful, they are exploited by attackers to run malicious and for-profit programs that typically require extremely high computing ability to be successful. Our classification framework leverages the distinctive signatures between illicit and authorized workloads, and explore machine learning methods to learn the workloads and classify them. The framework uses lightweight, non-intrusive workload profiling to collect model input data, and explores multiple machine learning methods, particularly recurrent neural network (RNN) that is suitable for online anomalous workload detection. Evaluation results on three generations of GPU machines demonstrate that the workload classification framework can tell apart the illicit authorized workloads with a high accuracy of over 95%.

Pengfei, Zou↗

Energetics and energy scaling of quasi-monoenergetic protons in laser radiation pressure acceleration

Theoretical and computational studies of the ion energy scaling of the radiation pressure acceleration of an ultra-thin foil by short pulse intense laser irradiation are presented. To obtain a quasi-monoenergetic ion beam with an energy spread of less than 20%, two-dimensional particle-in-cell simulations show that the maximum energy of the quasi-monoenergetic ion beam is limited by self-induced transparency at the density minima caused by the Rayleigh-Taylor instability. For foils of optimal thickness, the time over which Rayleigh-Taylor instability fully develops and transparency occurs is almost independent of the laser amplitude. With a laser power of about one petawatt, quasi-monogenetic protons with 200 MeV and carbon ions with 100 MeV per nucleon can be obtained, suitable for particle therapy applications.

43 PARTICLE ACCELERATORS↗

SU-F-BRD-09: A Random Walk Model Algorithm for Proton Dose Calculation

Purpose: To develop a random walk model algorithm for calculating proton dose with balanced computation burden and accuracy. Methods: Random walk (RW) model is sometimes referred to as a density Monte Carlo (MC) simulation. In MC proton dose calculation, the use of Gaussian angular distribution of protons due to multiple Coulomb scatter (MCS) is convenient, but in RW the use of Gaussian angular distribution requires an extremely large computation and memory. Thus, our RW model adopts spatial distribution from the angular one to accelerate the computation and to decrease the memory usage. From the physics and comparison with the MC simulations, we have determined and analytically expressed those critical variables affecting the dose accuracy in our RW model. Results: Besides those variables such as MCS, stopping power, energy spectrum after energy absorption etc., which have been extensively discussed in literature, the following variables were found to be critical in our RW model: (1) inverse squared law that can significantly reduce the computation burden and memory, (2) non-Gaussian spatial distribution after MCS, and (3) the mean direction of scatters at each voxel. In comparison to MC results, taken as reference, for a water phantom irradiated by mono-energetic proton beams from 75 MeV to 221.28 MeV, the gamma test pass rate was 100% for the 2%/2mm/10% criterion. For a highly heterogeneous phantom consisting of water embedded by a 10 cm cortical bone and a 10 cm lung in the Bragg peak region of the proton beam, the gamma test pass rate was greater than 98% for the 3%/3mm/10% criterion. Conclusion: We have determined key variables in our RW model for proton dose calculation. Compared with commercial pencil beam algorithms, our RW model much improves the dose accuracy in heterogeneous regions, and is about 10 times faster than MC simulations.

60 APPLIED LIFE SCIENCES↗

Turbulent Mixing Simulation via a Quantum Algorithm

Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this paper, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. Finally, the results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GPU-optimized Code for Long-term Simulations of Beam-beam Effects in Colliders

We report on the development of the new code for long-term simulation of beam-beam effects in particle colliders. The underlying physical model relies on a matrix-based arbitrary-order symplectic particle tracking for beam transport and the Bassetti-Erskine approximation for beam-beam interaction. The computations are accelerated through a parallel implementation on a hybrid GPU/CPU platform. With the new code, a previously computationally prohibitive long-term simulations become tractable. We use the new code to model the proposed medium-energy electron-ion collider (MEIC) at Jefferson Lab.

43 PARTICLE ACCELERATORS↗

Hybrid parallel code acceleration methods in full-core reactor physics calculations

When dealing with nuclear reactor calculation schemes, the need for three dimensional (3D) transport-based reference solutions is essential for both validation and optimization purposes. Considering a benchmark problem, this work investigates the potential of discrete ordinates (Sn) transport methods applied to 3D pressurized water reactor (PWR) full-core calculations. First, the benchmark problem is described. It involves a pin-by-pin description of a 3D PWR first core, and uses a 8-group cross-section library prepared with the DRAGON cell code. Then, a convergence analysis is performed using the PENTRAN parallel Sn Cartesian code. It discusses the spatial refinement and the associated angular quadrature required to properly describe the problem physics. It also shows that initializing the Sn solution with the EDF SPN solver COCAGNE reduces the number of iterations required to converge by nearly a factor of 6. Using a best estimate model, PENTRAN results are then compared to multigroup Monte Carlo results obtained with the MCNP5 code. Good consistency is observed between the two methods (Sn and Monte Carlo), with discrepancies that are less than 25 pcm for the k{sub eff}, and less than 2.1% and 1.6% for the flux at the pin-cell level and for the pin-power distribution, respectively. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. Here, we conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and datasets, Frog is able to significantly outperform existing GPU-based graph processing systems except Gunrock and MapGraph. MapGraph gets better performance than Frog when running BFS on RoadNet-CA. The comparison between Gunrock and Frog is inconclusive. Frog can outperform Gunrock more than 1.04X when running PageRank and SSSP, while the advantage of Frog is not obvious when running BFS and CC on some datasets especially for RoadNet-CA.

97 MATHEMATICS AND COMPUTING↗

Biology and medical research at the exascale.

Advances in computational hardware and algorithms that have transformed areas of physics and engineering have recently brought similar benefits to biology and biomedical research. Biological sciences are undergoing a revolution. High-performance computing has accelerated the transition from hypothesis-driven to design-driven research at all scales, and computational simulation of biological systems is now driving the direction of biological experimentation and the generation of insights.

99 GENERAL AND MISCELLANEOUS↗

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗

Solution of relativistic quantum optics problems using clusters of graphical processing units

Numerical solution of relativistic quantum optics problems requires high performance computing due to the rapid oscillations in a relativistic wavefunction. Clusters of graphical processing units are used to accelerate the computation of a time dependent relativistic wavefunction in an arbitrary external potential. The stationary states in a Coulomb potential and uniform magnetic field are determined analytically and numerically, so that they can used as initial conditions in fully time dependent calculations. Relativistic energy levels in extreme magnetic fields are recovered as a means of validation. The relativistic ionization rate is computed for an ion illuminated by a laser field near the usual barrier suppression threshold, and the ionizing wavefunction is displayed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DEVELOPMENT OF A SIMULATION CODE FOR A COOL-DOWN PROCESS OF THE CRYOGENIC HYDROGEN SYSTEM

Supercritical hydrogen with a pressure of 1.5 MPa and a temperature of 20 K has been selected as a moderator material in an intense spallation neutron source (JSNS), which is one of main experimental facilities in J-PARC. The cryogenic hydrogen system, in which a hydrogen circulation system is cooled by a helium refrigerator with the refrigeration power of 6.45 kW at 15.5 K, has been designed to provide the supercritical hydrogen to the moderator and to remove the nuclear heating generated there. In this study, we have developed a simulation code that predicts temperature behaviors in the hydrogen circulation system during its cool-down process. Cool-down process analyses have been performed, and an operational method for the cool-down process has been studied. The analytical results indicate that the hydrogen circulation system would be able to be cooled down to 18 K within 19 hours.

42 ENGINEERING↗

Kinetic particle simulation of discharge and wall erosion of a Hall thruster

The primary lifetime limiting factor of Hall thrusters is the wall erosion caused by the ion induced sputtering, which is predominated by dielectric wall sheath and pre-sheath. However, so far only fluid or hybrid simulation models were applied to wall erosion and lifetime studies in which this non-quasi-neutral and non-equilibrium area cannot be treated directly. Thus, in this study, a 2D fully kinetic particle-in-cell model was presented for Hall thruster discharge and lifetime simulation. Because the fully kinetic lifetime simulation was yet to be achieved so far due to the high computational cost, the semi-implicit field solver and the technique of mass ratio manipulation was employed to accelerate the computation. However, other artificial manipulations like permittivity or geometry scaling were not used in order to avoid unrecoverable change of physics. Additionally, a new physics recovering model for the mass ratio was presented for better preservation of electron mobility at the weakly magnetically confined plasma region. The validity of the presented model was examined by various parametric studies, and the thrust performance and wall erosion rate of a laboratory model magnetic layer type Hall thruster was modeled for different operation conditions. The simulation results successfully reproduced the measurement results with typically less than 10% discrepancy without tuning any numerical parameters. It is also shown that the computational cost was reduced to the level that the Hall thruster fully kinetic lifetime simulation is feasible.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Precise calculations of observables of polarized moller scattering: From JLAB to ILC energies

One-loop electroweak corrections to observables of the reaction e{sup -}e{sup -} {yields} e{sup -}e{sup -}({gamma}) were calculated over a broad range of energies: from conditions of the MOLLER experiment at the Thomas Jefferson Laboratory (JLab) to those of planned experiments at the International Linear Collider (ILC). The dependence of various contributions to the observable polarization asymmetry on various renormalization conditions was studied within the scheme of on-shell renormalization. The results were obtained by two methods: precisely, by applying the FeynArts, FormCalc, LoopTools, and Form computer codes, and approximately, with the aid of the asymptotic-estimation methods. The resulting compact formulas are absolutely free from nonphysical parameters and are convenient for deducing numerical estimates. It is shown that the total one-loop correction is independent of renormalization conditions and takes an identical value within different computational schemes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Shielding and Activation Analyses for Beam Test Facility at SNS

The beam test facility (BTF) will be a copy of the accelerator front end of the Spallation Neutron Source (SNS) facility and will be used for test and development of new front-end equipment, for conducting research in accelerator physics (in a further build-out) for the SNS second target station moderator development (tests). The BTF is assembled and will be operating in the radio frequency (RF) on-site annex building. Negatively charged hydrogen ions (H{sup -}), generated at the ion source, will be accelerated to 2.5 MeV. The facility is capable of producing one-ms-long pulses at 60 Hz repetition rate with up to 50 mA peak current. This beam will be safely terminated in the beam stop. In order to support the BTF project from a radiation protection point of view, neutronics simulations and activation analyses were performed to develop shielding around the beam stop, evaluate dose rates in case of an accident and to evaluate the radionuclide inventory at the facility end-of-life for decommissioning. The challenge of the analyses was to consider low energy charges particles reaction physics to fit the calculations into our routine transport and activation methods as practiced for the much higher energy spallation environment. (authors)

43 PARTICLE ACCELERATORS↗

Collimators and beam dumps for the APS-upgrade storage ring - 25478

Argonne's Advanced Photon Source is planning a major upgrade that will increase the storage ring current from the present 100 mA to 200 mA and decrease the beam lifetime due to high charge-per-bunch and substantially smaller transverse beam size. Collimators in the horizontal plane around the storage ring will be used to control beam losses. These collimators will also serve as whole beam dumps in cases where the stored beam must be dumped for machine protection. Another feature of the Upgrade is swap-out injection, in which a stored electron bunch will be extracted to a dedicated swap-out dump when its charge falls to about 90% of the initial value and immediately replaced with a new bunch. Since particle losses will be concentrated in these collimators and beam dumps, there is the potential for high dose rates around these locations and for activation of nearby accelerator components. This paper contains a brief summary of the APS Upgrade, discusses electron losses in the storage ring, and presents calculations of dose rates and induced activity around the collimators and beam dumps. (authors)

43 PARTICLE ACCELERATORS↗

Power Grid Computational Challenges and Metrics for Hardware Accelerator Evaluation

The objective of this document is to support the DMC initiative’s research on hardware and software development. Our focus is on the power grid domain that has a rich diversity of numerical and computationally challenging applications. Through this document, we highlight two core building blocks, power flow, and transient stability equations, for power grid applications. Improving computational robustness and acceleration of these core blocks will tremendously benefit all power grid applications. We also highlight the most computationally dominant numerical kernels that are being used in power flow and transient stability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

EFFICIENT PARALLEL COMPUTATION OF ALL-PAIRS N-BODY ACCELERATION BY DO-LOOP FOLDING

The computational load inside a do loop is equalized by folding the loop appropriately if the amount of load is a linear function of the loop index. Using this idea, we develop an efficient parallel computation scheme of Newtonian all-pairs N-body acceleration vectors with help from OpenMP architecture. Using a consumer PC with a quad-core eight-thread processor, the new parallel scheme runs 4.2-4.9 times faster than a serial computation when the number of particles exceeds a few hundred.

79 ASTRONOMY AND ASTROPHYSICS↗

High-performance dynamic quantum clustering on graphics processors

Clustering methods in machine learning may benefit from borrowing metaphors from physics. Dynamic quantum clustering associates a Gaussian wave packet with the multidimensional data points and regards them as eigenfunctions of the Schroedinger equation. The clustering structure emerges by letting the system evolve and the visual nature of the algorithm has been shown to be useful in a range of applications. Furthermore, the method only uses matrix operations, which readily lend themselves to parallelization. In this paper, we develop an implementation on graphics hardware and investigate how this approach can accelerate the computations. We achieve a speedup of up to two magnitudes over a multicore CPU implementation, which proves that quantum-like methods and acceleration by graphics processing units have a great relevance to machine learning.

97 MATHEMATICS AND COMPUTING↗