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 361 records · Page 20

SMR Accelerated Development Needs with Adequate Safety

The development of advanced Small Modular Reactors (SMRs) is ongoing. A customer-focused development approach requires accelerated design and analysis of the reactor system while minimizing engineering, regulatory, and economic challenges. SMRs, although not a new concept, are being considered for rapid deployment with optimized economic scalability, and several designs are currently seeking approval. Understanding the research and development needs, with adequate safety support, accelerates reactor development.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Numerical modeling of laser tunneling ionization in explicit particle-in-cell codes

Methods for the calculation of laser tunneling ionization in explicit particle-in-cell codes used for modeling laser–plasma interactions are compared and validated against theoretical predictions. Improved accuracy is obtained by using the direct current form for the ionization rate. Multi level ionization in a single time step and energy conservation have been considered during the ionization process. The effects of grid resolution and number of macro-particles per cell are examined. Implementation of the ionization algorithm in two different particle-in-cell codes is compared for the case of ionization-based electron injection in a laser–plasma accelerator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of ARCHER towards clinical use: modeling and simulation of Varian Linac for radiation therapy dose calculations - 25449

Monte Carlo particle transport methods are well recognized as the most accurate approach to dose calculations for radiation therapy treatment planning. However, the lengthy calculation time has prevented Monte Carlo methods from being applied to dose calculations in the planning of radiation therapy. Recently, the emerging parallel computing hardware accelerators, such as general-purpose Graphics Processing Unit (GPU), have significantly boosted the performance of Monte Carlo codes. The accuracy of a clinical dose engine depends greatly on the accuracy of source term modeling and the methodology of dose calculations. Hence, in this study, an efficient and accurate source model of the Varian TrueBeam{sup R} Linac is developed and integrated with a fast photon-electron transport module of the recently developed high-performance Monte Carlo code, ARCHER. The validity of the source model and the particle transport physics are verified with established dose calculation codes such as EGSnrc and validated with experimental measurements. To demonstrate the capability of the platform in clinical applications, three clinical treatment plans (the lung, breast, and prostate) are simulated and analyzed. From the perspective of performance, the entire simulation of each clinical plan, starting from the source modeling to the end of particle transport within the patient phantom, can be finished in less than one minute using a single Titan X GPU card with 1% statistical error. In comparison, the same cases take the EGSnrc code hundreds of CPU hours to finish. The results suggest that this new version of ARCHER code has been successfully developed and tested as a clinically deployable dose engine for external photon beam IMRT plans in the clinical setting. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Comparisons of time explicit hybrid kinetic-fluid code Architect for Plasma Wakefield Acceleration with a full PIC code

Architect, a time explicit hybrid code designed to perform quick simulations for electron driven plasma wakefield acceleration, is described. In order to obtain beam quality acceptable for applications, control of the beam-plasma-dynamics is necessary. Particle in Cell (PIC) codes represent the state-of-the-art technique to investigate the underlying physics and possible experimental scenarios; however PIC codes demand the necessity of heavy computational resources. Architect code substantially reduces the need for computational resources by using a hybrid approach: relativistic electron bunches are treated kinetically as in a PIC code and the background plasma as a fluid. Cylindrical symmetry is assumed for the solution of the electromagnetic fields and fluid equations. In this paper both the underlying algorithms as well as a comparison with a fully three dimensional particle in cell code are reported. The comparison highlights the good agreement between the two models up to the weakly non-linear regimes. In highly non-linear regimes the two models only disagree in a localized region, where the plasma electrons expelled by the bunch close up at the end of the first plasma oscillation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty-aware molecular dynamics from Bayesian active learning for phase transformations and thermal transport in SiC

Abstract Machine learning interatomic force fields are promising for combining high computational efficiency and accuracy in modeling quantum interactions and simulating atomistic dynamics. Active learning methods have been recently developed to train force fields efficiently and automatically. Among them, Bayesian active learning utilizes principled uncertainty quantification to make data acquisition decisions. In this work, we present a general Bayesian active learning workflow, where the force field is constructed from a sparse Gaussian process regression model based on atomic cluster expansion descriptors. To circumvent the high computational cost of the sparse Gaussian process uncertainty calculation, we formulate a high-performance approximate mapping of the uncertainty and demonstrate a speedup of several orders of magnitude. We demonstrate the autonomous active learning workflow by training a Bayesian force field model for silicon carbide (SiC) polymorphs in only a few days of computer time and show that pressure-induced phase transformations are accurately captured. The resulting model exhibits close agreement with both ab initio calculations and experimental measurements, and outperforms existing empirical models on vibrational and thermal properties. The active learning workflow readily generalizes to a wide range of material systems and accelerates their computational understanding.

36 MATERIALS SCIENCE↗

MOSIQS: Persistent Memory Object Storage With Metadata Indexing and Querying for Scientific Computing

Scientific applications often require high-bandwidth shared storage to perform joint simulations and collaborative data analytics. Shared memory pools provide a chance to satisfy such needs. Recently, a high-speed network such as Gen-Z utilizing persistent memory (PM) offers an opportunity to create a shared memory pool connected to compute nodes. However, there are several challenges to use scientific applications on the shared memory pool directly such as scalability, failure-atomicity, and lack of scientific metadata-based search and query. In this paper, we propose MOSIQS, a persistent memory object storage framework with metadata indexing and querying for scientific computing. We design MOSIQS based on the key idea that memory objects on PM pool can live beyond the application lifetime and can become the sharing currency for applications and scientists. MOSIQS provides an aggregate memory pool atop an array of persistent memory devices to store and access memory objects to accelerate scientific computing. MOSIQS uses a lightweight persistent memory key-value store to manage the metadata of memory objects, which enables memory object sharing. To facilitate metadata search and query over millions of memory objects resident on memory pool, we introduce Group Split and Merge (GSM), a novel persistent index data structure designed primarily for scientific datasets. GSM splits and merges dynamically to minimize the query search space and maintains low query processing time while overcoming the index storage overhead. MOSIQS is implemented on top of PMDK. We evaluate the proposed approach on many-core server with an array of real PM devices. Experimental results show that MOSIQS gains a 100% write performance improvement and executes multi-attribute queries efficiently with 2.7× less index storage overhead offering significant potential to speed up scientific computing applications.

97 MATHEMATICS AND COMPUTING↗

A new least-squares transport equation compatible with voids

We define a new least-squares transport equation that is applicable in voids, can be solved using source iteration with diffusion-synthetic acceleration, and requires only the solution of an independent set of second-order self-adjoint equations for each direction during each source iteration. We derive the equation, discretize it using the S{sub n} method in conjunction with a linear-continuous finite-element method in space, and computationally demonstrate various of its properties. (authors)

97 MATHEMATICS AND COMPUTING↗

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗

Complex Systems Research at LANL [Slides]

Mathematics, computer science, and technologies required to extract information, knowledge, and insight from data. Thrust leverages advances in theory, algorithms, and the exponential growth of high–performance computing to accelerate the integrative and predictive capability of the scientific method. Thrust focuses on the integration of LANL capabilities for understanding, prediction, and design of complex, natural and engineered systems.

97 MATHEMATICS AND COMPUTING↗

Dynamic System Scaling Application to Accelerated Nuclear Fuel Testing

The development of nuclear fuel and materials requires a continuous effort to investigate the acute and prolonged effects of irradiation, thermal-material stress, chemical change, or other conceivable damage mechanics acquired during normal operation or accident scenarios throughout its lifetime. As in-core fuel property measurement techniques advance to support in the real-time, non-invasive, and enhanced accuracy realm, it is the future of fuel development to pursue to higher degrees of control, predictability of integral test behavior via separate effects test (SET), and shorter test time intervals. The fuel development life cycle from initial concept to commercial licensing is approximated to be 20 years and current literature suggests by optimizing fuel performance codes with SETs, the process could possibly be compressed to 5 to 10 years. Recently, a research group in the Idaho National Laboratory (INL) is testing reduced scale fuel rods and increased power density to accelerate evolution of fuel phenomena in metallic fuels. In support of nuclear fuel rod development, compressing fuel test process, and accelerating fuel phenomena, it was the purpose of this study to investigate nuclear fuel performance phenomena via literature review and effectively scale the initial conditions, boundary conditions, and geometric properties to describe the time-dependent response including to fuel burnup, thermal and mechanical stress, transmutations and inter-diffusion, and other relevant observed phenomena. The study was based on BISON simulations of historic EBR-II metallic fuel experiments and Dynamical System Scaling (DSS) method are utilized to assess effects of scaling activity including fuel phenomena acceleration and calculations of time-dependent distortions. The research successfully scaled metallic fuel phenomena, accelerated fuel testing, and assessed the distortions for each scaled case derived.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Monte Carlo solution methods in a moment-based scale-bridging algorithm for thermal radiative transfer problems: Comparison with Fleck and Cummings

We have developed a moment-based scale-bridging algorithm for thermal radiative transfer problems. The algorithm takes the form of well-known nonlinear-diffusion acceleration which utilizes a low-order (LO) continuum problem to accelerate the solution of a high-order (HO) kinetic problem. The coupled nonlinear equations that form the LO problem are efficiently solved using a preconditioned Jacobian-free Newton-Krylov method. This work demonstrates the applicability of the scale-bridging algorithm with a Monte Carlo HO solver and reports the computational efficiency of the algorithm in comparison to the well-known Fleck-Cummings algorithm. (authors)

97 MATHEMATICS AND COMPUTING↗

New Parallel computing framework for radiation transport codes

A new parallel computing framework has been developed to use with general-purpose radiation transport codes. The framework was implemented as a C++ module that uses MPI for message passing. The module is significantly independent of radiation transport codes it can be used with, and is connected to the codes by means of a number of interface functions. The framework was integrated with the MARS15 code, and an effort is under way to deploy it in PHITS. Besides the parallel computing functionality, the framework offers a checkpoint facility that allows restarting calculations with a saved checkpoint file. The checkpoint facility can be used in single process calculations as well as in the parallel regime. Several checkpoint files can be merged into one thus combining results of several calculations. The framework also corrects some of the known problems with the scheduling and load balancing found in the original implementations of the parallel computing functionality in MARS15 and PHITS. The framework can be used efficiently on homogeneous systems and networks of workstations, where the interference from the other users is possible.

43 PARTICLE ACCELERATORS↗

Brownian motion on [0,∞) with linear drift, reflected at zero: exact asymptotics for ergodic means

For the Brownian motion X{sub μ}(t) on the half-axis [0,∞) with linear drift μ, reflected at zero and for fixed numbers p>0, δ>0, d>0, a≥0, we calculate the exact asymptotics as T→∞ of the mathematical expectations and probabilities as well as of their conditional versions. For p=1 we give explicit formulae for the emerging constants via the Airy function. We consider an application of the results obtained to the problem of studying the behaviour of a Brownian particle in a gravitational field in a container bounded below by an impenetrable wall when μ=−mg/(2kT{sub K}), where m is the mass of the Brownian particle, g is the gravitational acceleration, k is the Boltzmann constant, T{sub K} is the temperature in the Kelvin scale. The analysis is conducted by the Laplace method for the sojourn time of homogeneous Markov processes. Bibliography: 31 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

A hybrid approach to the neutron transport K-eigenvalue problem using NDA-based algorithms

In order to provide more physically accurate solutions to the neutron transport equation it has become increasingly popular to use Monte Carlo simulation to model nuclear reactor dynamics. These Monte Carlo methods can be extremely expensive, so we turn to a class of methods known as hybrid methods, which combine known deterministic and stochastic techniques to solve the transport equation. In our work, we show that we can simulate the action of a transport sweep using a Monte Carlo simulation in order to solve the k-eigenvalue problem. We'll accelerate the solution using nonlinear diffusion acceleration (NDA) as in [1,2]. Our work extends the results in [1] to use Monte Carlo simulation as the high-order solver. (authors)

97 MATHEMATICS AND COMPUTING↗

Implementation of Krylov acceleration method for 3D S{sub N} transport code AETIUS with unstructured tetrahedral mesh - 25557

We have been developing an in-house deterministic neutron and gamma transport solver, AETIUS (An Easy modeling Transport code using Unstructured tetrahedral mesh, Shared memory parallel). To achieve fast results, BiCGStab (one of the Krylov acceleration methods) was implemented as a within-group iteration solver. In this paper, two test problems (simple double cube problem and helical tube in the outer cube problem) were used to verify the acceleration performance. The number of iterations and the calculation time were demonstrated and compared with the source iteration. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

The Acceleration of Energetic Particles at Coronal Shocks and Emergence of a Double Power-law Feature in Particle Energy Spectra

We present numerical modeling of particle acceleration at coronal shocks propagating through a streamer-like magnetic field by solving the Parker transport equation with spatial diffusion both along and across the magnetic field. We show that the location on the shock where the high-energy particle intensity is the largest, depends on the energy of the particles and on time. The acceleration of particles to more than 100 MeV mainly occurs in the shock-streamer interaction region, due to perpendicular shock geometry and the trapping effect of closed magnetic fields. A comparison of the particle spectra to that in a radial magnetic field shows that the intensity at 100 MeV (200 MeV) is enhanced by more than one order (two orders) of magnitude. This indicates that the streamer-like magnetic field can be an important factor in producing large solar energetic particle events. We also show that the energy spectrum integrated over the simulation domain consists of two different power laws. Further analysis suggests that it may be a mixture of two distinct populations accelerated in the streamer and open field regions, where the acceleration rate differs substantially. Our calculations also show that the particle spectra are affected considerably by a number of parameters, such as the streamer tilt angle, particle spatial diffusion coefficient, and shock compression ratio. While the low-energy spectra agree well with standard diffusive shock acceleration theory, the break energy ranges from ~1 MeV to ~90 MeV and the high-energy spectra can extend to ~1 GeV with a slope of ~2–3.

97 MATHEMATICS AND COMPUTING↗