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 451 records · Page 25

Pin-by-Pin Core Calculation with an NEM-Based Two-Level Hybrid CMFD Algorithm

In the near future, systematic pin-by-pin core calculations are expected to provide a high level of accuracy. These are being developed in pursuit of high-fidelity tools for analyzing the reactor configurations. One such tool that has recently gained significant attention is the pin-by-pin core calculation via local-global iteration using nonlinear acceleration scheme, such as the One-Node CMFD (Coarse-Mesh Finite Difference) nonlinear algorithm. The One-Node CMFD method uses two correction factors to preserve the interface current, in contrast to the one correction term employed by conventional nonlinear iterative methods such as that proposed by Kord. S. Smith. These correction factors are updated with surface flux and net current which are obtained from a high order local problem. With two correction factors, One-Node CMFD can reduce computing time of local FMFD (Fine-Mesh Finite Difference) as it nonlinearly couples the CMFD and FMFD methods in global-local iterations. Nonetheless, very small mesh size is still required and it consequently requires long computing time for high accuracy. As such, a more flexible approach is needed to address this challenge. This paper presents one such possible approach named the hCMFD (Hybrid CMFD) method. In this method, One-Node CMFD is used to solve the global problem, while Two-Node NEM (Nodal Expansion Method) CMFD replaces FMFD as the solver for the local problem. In this paper, two kinds of CMFD methods has been simultaneously implemented for a global-local nonlinear iteration in order to do pin-by-pin heterogeneous reactor calculations. The global problem is solved by a one-node CMFD which uses two correction factors, while the local fixed-source problem is solved by the conventional two-node NEM CMFD which use one correction factor on a surface. From solution of the global eigenvalue problem, incoming partial current is obtained and it is used as boundary condition of the local fixed-source problems. It has been shown that over 99% of the whole calculations can be done in parallel with the new CMFD method for 2-D problems and the algorithm can be easily parallelized by using the OpenMP parallel scheme. The hCMFD method will enable an efficient pin-by-pin reactor analysis since a very efficient parallel calculation is possible with the hCMFD method. In future works, the hCMFD method will be extended to three-dimensional reactor problem. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Comparative Study of Physics‐Informed and Data‐Driven Neural Networks for Compound Flood Simulation at River‐Ocean Interfaces: A Case Study of Hurricane Irene

Simulating compound flooding (CF) at the river-ocean interface within large-scale Earth System Models (ESMs) presents significant challenges due to complex interactions between river discharge, storm surge, and tides. This study assesses the comparative advantages of physics-informed and data-driven machine learning (ML) approaches for enhancing local ESM performance. We systematically compare data-driven neural network models (i.e., CNNs, U-Net, Long Short-Term Memory (LSTM), Gated Recurrent Unit), and physics-informed neural network (PINN) models, including vanilla PINN and a finite-difference-based PINN (FD-PINN). Specifically, FD-PINN is introduced to enhance computational efficiency, accelerating vanilla PINNs by ∼6.5 times while improving accuracy. To enhance data-driven model training, a new data-generation approach is developed to sample historical fluvial and coastal flood events, which ensures a robust data set for extreme event prediction. The models are evaluated using a realistic one-dimensional river domain extracted from an ESM's river mesh and the Hurricane Irene event as an independent test case. Results show that FD-PINN achieves accurate predictions with significantly reduced computational costs relative to vanilla PINNs. Among data-driven models, the best overall performance is achieved by a CNN-LSTM hybrid, which balances accuracy and efficiency. While a fully connected CNN (CNN-FC) provides the best accuracy, it incurs high computational cost. Architectures lacking strong temporal modeling tend to underperform on unseen events. These findings highlight the importance of sequence-aware designs for robust generalization. This study reveals the trade-offs between physics-informed and data-driven models and proposes an adaptive hybrid framework for integrating ML into ESMs to enhance local flood simulations.

Earth Systems Modeling↗

On the Use of GPUs in Realizing Cost-Effective Distributed RAID

The exponential growth in user and application data entails new means for providing fault tolerance and protection against data loss. High Performance Computing (HPC) storage systems, which are at the forefront of handling the data deluge, typically employ hardware RAID at the backend. However, such solutions are costly, do not ensure end-to-end data integrity, and can become a bottleneck during data reconstruction. In this paper, we design an innovative solution to achieve a flexible, fault-tolerant, and high-performance RAID-6 solution for a parallel file system (PFS). Our system utilizes low-cost, strategically placed GPUs - both on the client and server sides - to accelerate parity computation. In contrast to hardware-based approaches, we provide full control over the size, length and location of a RAID array on a per file basis, end-to-end data integrity checking, and parallelization of RAID array reconstruction. We have deployed our system in conjunction with the widely-used Lustre PFS, and show that our approach is feasible and imposes acceptable overhead.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimization and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it also used significantly less computer memory.

60 APPLIED LIFE SCIENCES↗

Accelerated expansion of the universe à la the Stueckelberg mechanism

We investigate a cosmological model in which the Stueckelberg fields are non-minimally coupled to the scalar curvature in a gauge invariant manner. We present not only a solution that can be considered in the context of the late time acceleration of the universe but also a solution compatible with the inflationary cosmology. Distinct behaviors of the scalar and vector fields together with the real valued mass gained by the Stueckelberg mechanism lead the universe to go through the two different accelerated expansion phases with a decelerated expansion phase between them. On the other hand, in the solutions we present, if the mass is null then the universe is either static or exhibits a simple power law expansion due to the vector field potential.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance study of GPUs in real-time trigger applications for HEP experiments

Graphical Processing Units (GPUs) have evolved into highly parallel, multi-threaded, multicore powerful processors with high memory bandwidth. GPUs are used in a variety of intensive computing applications. The combination of highly parallel architecture and high memory bandwidth makes GPUs a potentially promising technology for effective real-time processing for High Energy Physics (HEP) experiments. However, not much is known of their performance in real-time applications that require low latency, such as the trigger for HEP experiments. We describe an R and D project with the goal to study the performance of GPU technology for possible low latency applications, performing basic operations as well as some more advanced HEP lower-level trigger algorithms (such as fast tracking or jet finding). We present some preliminary results on timing measurements, comparing the performance of a CPU versus a GPU with NVIDIA's CUDA general-purpose parallel computing architecture, carried out at CDF's Level-2 trigger test stand. These studies will provide performance benchmarks for future studies to investigate the potential and limitations of GPUs for real-time applications in HEP experiments.

43 PARTICLE ACCELERATORS↗

Measuring the 2{gamma} Exchange Effect in Electron-Proton Scattering at CLAS

Recent results from experiments at Jefferson Laboratory, Newport News VA, which measure the ratio of the electric to magnetic form factors of the proton, G{sub E}/G{sub M}, have forced us to reexamine the single photon exchange approximation in lepton-proton elastic scattering. Discrepancies between the ratio obtained via the time-tested Rosenbluth separation method and new polarization transfer measurements, which differ by as much as a factor of three, may be resolved by considering the effect of two photon exchange (TPE). Theoretical corrections for the TPE effect are difficult due to the large number of excited nucleon states that can contribute to the process. The TPE effect can, however, be determined directly by measuring the ratio of the positron-proton to electron-proton elastic scattering cross sections, R = {sigma}(e{sup +})/{sigma}(e{sup -}), since the TPE effect changes sign with the charge of the incident particle. The CLAS TPE experiment at Jefferson Laboratory, will determine the effect of two-photon exchange in elastic lepton-proton scattering by precisely measuring the ratio of positron-proton to electron-proton elastic cross sections over a large kinematic range (0.1<{epsilon}<0.96, 0.02{<=}Q{sup 2}{<=}2.0). We will accomplish this by directing the 5.5 GeV primary electron beam, provided by the Continuous Electron Beam Accelerator Facility (CEBAF), onto a set of radiators and converters to produce simultaneous and identical beams of electron and positrons. Acceptance and efficiency concerns are minimized by only considering the ratios of the elastic cross sections and switching polarity of magnets in the beam line and the spectrometer. Guided by the results of a short 2006 test run and extensive GEANT based modeling, new shielding and beam line components were designed to maximize luminosity. The unique experimental design and challenges of the TPE experiment and the projected luminosities will be presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Deep Learning Based Workflow for Accelerated Industrial X-Ray Computed Tomography

X-ray computed tomography (XCT) is an important tool for high-resolution non-destructive characterization of additively-manufactured metal components. XCT reconstructions of metal components may have beam hardening artifacts such as cupping and streaking which makes reliable detection of flaws and defects challenging. Furthermore, traditional workflows based on using analytic reconstruction algorithms require a large number of projections for accurate characterization - leading to longer measurement times and hindering the adoption of XCT for in-line inspections. In this paper, we introduce a new workflow based on the use of two neural networks to obtain high-quality accelerated reconstructions from sparse-view XCT scans of single material metal parts. The first network, implemented using fully-connected layers, helps reduce the impact of BH in the projection data without the need of any calibration or knowledge of the component material. The second network, a convolutional neural network, maps a low-quality analytic 3D reconstruction to a high-quality reconstruction. Using experimental data, we demonstrate that our method robustly generalizes across several alloys, and for a range of sparsity levels without any need for retraining the networks thereby enabling accurate and fast industrial XCT inspections.

Rahman, Obaid↗

Design of a Commercial Scale Accelerator Driven Subcritical Aqueous Assembly

SHINE Medical Technologies is working towards producing a reliable, domestic supply of medical isotopes, including molybdenum-99 (Mo-99), xenon-133, and iodine 131, without using highly enriched uranium. Approximately 88% of Mo-99 decays to technetium-99m, which is the most widely used medical isotope in the world, accounting for approximately 80% of all nuclear medicine procedures. A novel aqueous, subcritical nuclear assembly has been designed by SHINE Medical Technologies. The assembly can produce medical radioisotopes in significant quantities for U.S. and foreign needs. The assembly produces isotopes without using a reactor, instead using a fusion-based neutron source coupled to a fission-based aqueous assembly. The subcritical nature of the aqueous assembly has safety and licensing benefits, including the elimination of the reactor control system and elimination of high level waste. SHINE plans to construct eight subcritical assemblies with a plant capacity of greater than 3000 6-day Curies, which is more than one-quarter of the world's Mo-99 requirements. From a nuclear design standpoint, the aqueous subcritical assembly needs to be able to generate sufficient fission power to meet the production capacity requirements while remaining subcritical at all times with an acceptable margin. To address these conflicting design goals, a simple nuclear design and reactivity control philosophy has been developed that allows for high power operation with a high degree of safety. A fusion-driven subcritical fission assembly has been designed by SHINE Medical Technologies to provide a reliable, domestic supply of medical isotopes. Nuclear models have been created and show that the assembly can be started up, operated, and shutdown in a safe manner without active reactivity control systems. A unique reactivity control strategy allows SHINE to operate the aqueous subcritical assembly at much higher power levels than would otherwise be practical, while still retaining the benefits of subcritical operation and avoiding the need for complex subcritical measurement techniques. Based on the current design, the subcritical target is capable of generating significant fission power (on the order of 100 kW) when being driven by a simple, low-cost deuterium-tritium accelerator, enabling the SHINE facility to supply over one-fourth of the worldwide demand of Mo- 99. SHINE has recently been issued a construction permit by the U.S. Nuclear Regulatory Commission to build the commercial facility in Janesville, WI, with eight subcritical assemblies and the associated production equipment. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗

A diffusion synthetic acceleration scheme for rectangular geometries based on bilinear discontinuous finite elements

A DSA technique to accelerate the iterative convergence of S{sub n} transport solves is derived for bilinear discontinuous (BLD) finite elements on rectangular grids. The diffusion synthetic acceleration equations are discretized using BLD elements by adapting the Modified Interior Penalty technique, introduced in [4] for triangular grids. The MIP-DSA equations are SPD and thus are solved using a preconditioned CG technique. Fourier analyses and implementation of the technique in a BLD S{sub n} transport code show that the technique is stable is effective. (authors)

97 MATHEMATICS AND COMPUTING↗

P4: Portable Parallel Processing Pipelines for Interactive Information Visualization

We present P4, an information visualization toolkit that combines declarative design specification and GPU computing for building high-performance interactive systems. Most of the existing information visualization toolkits do not harness the power of parallel processors in today's mainstream computers. P4 leverages GPU computing to accelerate both data processing and visualization rendering for interactive visualization applications. P4's programming interface offers a declarative visualization grammar for rapid specifications of data transformations, visual encodings, and interactions. By simplifying the development of GPU-accelerated visualization systems while supporting a high degree of flexibility and customization for design specification, P4 narrows the gap between expressiveness and scalability in information visualization toolkits. Through a range of examples and benchmark tests, we demonstrate that P4 provides high efficiency for creating interactive visualizations and offers drastic performance improvement over current state-of-the-art toolkits.

97 MATHEMATICS AND COMPUTING↗

A new indirect measure of diffusion model error

We define a new indirect measure of the diffusion model error called the diffusion model error source. When this model error source is added to the diffusion equation, the transport solution for the angular-integrated intensity is obtained. This source represents a means by which a transport code can be used to generate information relating to the adequacy of diffusion theory for any given problem without actually solving the diffusion equation. The generation of this source does not relate in any way to acceleration of the iterative convergence of transport solutions. Perhaps the most well-known indirect measure of the diffusion model error is the variable-Eddington tensor. This tensor provides a great deal of information about the angular dependence of the angular intensity solution, but it is not always simple to interpret. In contrast, our diffusion model error source is a scalar that is conceptually easy to understand. In addition to defining the diffusion model error source analytically, we show how to generate this source numerically relative to the S{sub n} radiative transfer equations with linear-discontinuous spatial discretization. This numerical source is computationally tested and shown to reproduce the Sn solution for a Marshak-wave problem. (authors)

97 MATHEMATICS AND COMPUTING↗

NEAMS Experimental Support for Code Validation, INL FY2009

The goal is for all modeling and simulation tools to be demonstrated accurate and reliable through a formal Verification and Validation (V&V) process, especially where such tools are to be used to establish safety margins and support regulatory compliance, or to design a system in a manner that reduces the role of expensive mockups and prototypes. Whereas the Verification part of the process does not rely on experiment, the Validation part, on the contrary, necessitates as many relevant and precise experimental data as possible to make sure the models reproduce reality as closely as possible. Hence, this report presents a limited selection of experimental data that could be used to validate the codes devoted mainly to Fast Neutron Reactor calculations in the US. Emphasis has been put on existing data for thermal-hydraulics, fuel and reactor physics. The principles of a new “smart” experiment that could be used to improve our knowledge of neutron cross-sections are presented as well. In short, it consists in irradiating a few milligrams of actinides and analyzing the results with Accelerator Mass Spectroscopy to infer the neutron cross-sections. Finally, the wealth of experimental data relevant to Fast Neutron Reactors in the US should not be taken for granted and efforts should be put on saving these 30-40 years old data and on making sure they are validation-worthy, i.e. that the experimental conditions and uncertainties are well documented.

97 MATHEMATICS AND COMPUTING↗

Coupling Visualization and Data Analysis for Knowledge Discovery from Multi-dimensional Scientific Data

Knowledge discovery from large and complex scientific data is a challenging task. With the ability to measure and simulate more processes at increasingly finer spatial and temporal scales, the growing number of data dimensions and data objects presents tremendous challenges for effective data analysis and data exploration methods and tools. The combination and close integration of methods from scientific visualization, information visualization, automated data analysis, and other enabling technologies"such as efficient data management" supports knowledge discovery from multi-dimensional scientific data. This paper surveys two distinct applications in developmental biology and accelerator physics, illustrating the effectiveness of the described approach.

97 MATHEMATICS AND COMPUTING↗

Bayesian Analysis of Step-Stress Accelerated Life Test with Exponential Distribution

In this article, we propose a general Bayesian inference approach to the step-stress accelerated life test with type II censoring. We assume that the failure times at each stress level are exponentially distributed and the test units are tested in an increasing order of stress levels. We formulate the prior distribution of the parameters of life-stress function and integrate the engineering knowledge of product failure rate and acceleration factor into the prior. The posterior distribution and the point estimates for the parameters of interest are provided. Through the Markov chain Monte Carlo technique, we demonstrate a nonconjugate prior case using an industrial example. It is shown that with the Bayesian approach, the statistical precision of parameter estimation is improved and, consequently, the required number of failures could be reduced.

14 SOLAR ENERGY↗

Further developments in generating type-safe messaging

At ICALEPCS 09, we introduced a source code generator that allows processes to communicate safely using data types native to each host language. In this paper, we discuss further development that has occurred since the conference in Kobe, Japan, including the addition of three more client languages, an optimization in network packet size and the addition of a new protocol data type. The protocol compiler is continuing to prove itself as an easy and robust way to get applications written in different languages hosted on different computer architectures to communicate. We have two active Erlang projects that are using the protocol compiler to access ACNET data at high data rates. We also used the protocol compiler output to deliver ACNET data to an iPhone/iPad application. Since it takes an average of two weeks to support a new language, we're willing to expand the protocol compiler to support new languages that our community uses.

43 PARTICLE ACCELERATORS↗