Search NASA⌕ Search

SEARCH · Search NASA

Results for “high performance and distributed 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 523 records · Page 29

Livermore Big Artificial Neural Network Toolkit

LBANN is a toolkit that is designed to train artificial neural networks efficiently on high performance computing architectures. It is optimized to take advantages of key High Performance Computing features to accelerate neural network training. Specifically it is optimized for low-latency, high bandwidth interconnects, node-local NVRAM, node-local GPU accelerators, and high bandwidth parallel file systems. It is built on top of the open source Elemental distributed-memory dense and spars-direct linear algebra and optimization library that is released under the BSD license. The algorithms contained within LBANN are drawn from the academic literature and implemented to work within a distributed-memory framework.

Essen, BrianVan↗

Sub-Second Parallel State Estimation

This report describes the performance of Pacific Northwest National Laboratory (PNNL) sub-second parallel state estimation (PSE) tool using the utility data from the Bonneville Power Administrative (BPA) and discusses the benefits of the fast computational speed for power system applications. The test data were provided by BPA. They are two-days’ worth of hourly snapshots that include power system data and measurement sets in a commercial tool format. These data are extracted out from the commercial tool box and fed into the PSE tool. With the help of advanced solvers, the PSE tool is able to solve each BPA hourly state estimation problem within one second, which is more than 10 times faster than today’s commercial tool. This improved computational performance can help increase the reliability value of state estimation in many aspects: (1) the shorter the time required for execution of state estimation, the more time remains for operators to take appropriate actions, and/or to apply automatic or manual corrective control actions. This increases the chances of arresting or mitigating the impact of cascading failures; (2) the SE can be executed multiple times within time allowance. Therefore, the robustness of SE can be enhanced by repeating the execution of the SE with adaptive adjustments, including removing bad data and/or adjusting different initial conditions to compute a better estimate within the same time as a traditional state estimator’s single estimate. There are other benefits with the sub-second SE, such as that the PSE results can potentially be used in local and/or wide-area automatic corrective control actions that are currently dependent on raw measurements to minimize the impact of bad measurements, and provides opportunities to enhance the power grid reliability and efficiency. PSE also can enable other advanced tools that rely on SE outputs and could be used to further improve operators’ actions and automated controls to mitigate effects of severe events on the grid. The power grid continues to grow and the number of measurements is increasing at an accelerated rate due to the variety of smart grid devices being introduced. A parallel state estimation implementation will have better performance than traditional, sequential state estimation by utilizing the power of high performance computing (HPC). This increased performance positions parallel state estimators as valuable tools for operating the increasingly more complex power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Costa - Introduction to 2015 Annual Report

In parallel with Sandia National Laboratories having two major locations (NM and CA), along with a number of smaller facilities across the nation, so too is the distribution of scientific, engineering and computing resources. As a part of Sandia’s Institutional Computing Program, CA site-based Sandia computer scientists and engineers have been providing mission and research staff with local CA resident expertise on computing options while also focusing on two growing high performance computing research problems. The first is how to increase system resilience to failure, as machines grow larger, more complex and heterogeneous. The second is how to ensure that computer hardware and configurations are optimized for specialized data analytical mission needs within the overall Sandia computing environment, including the HPC subenvironment. All of these activities support the larger Sandia effort in accelerating development and integration of high performance computing into national security missions. Sandia continues to both promote national R&D objectives, including the recent Presidential Executive Order establishing the National Strategic Computing Initiative and work to ensure that the full range of computing services and capabilities are available for all mission responsibilities, from national security to energy to homeland defense.

97 MATHEMATICS AND COMPUTING↗

High Fidelity CFD Simulations Supporting the KP-FHR

Kairos Power, LLC, is developing its version of the Fluoride-cooled High-temperature Reactor, the KP-FHR. The design uses a pebble bed core with fluoride salt as a coolant. The pebbles used in the KP-FHR have a diameter of 4 cm, with a shell fuel region where TRISO particles are embedded. A Pebble bed core design is adopted by several Gen IV reactors, They boast many benefits, such as fuel integrity, highly efficient heat transfer, and passive safety. However, it is challenging to accurately predict temperature and flow inside a pebble bed. Traditional approaches use the porous media model, which regards the pebble bed as a continuous medium, but with different temperature fields representing different levels, such as the fluid temperature, pebble surface temperature, and pebble center temperature. Empirical heat transfer correlations are adopted to calculate the heat transfer coefficient between different phases. However, empirical correlations are usually validated with experimental data, which usually lacks detail inside the pebble bed. The available experimental data is also generally at a high Reynolds number, which falls outside of the conditions of KP-FHR. Explicit computational fluid dynamics (CFD) simulations of randomly packed pebble beds have only become feasible recently. This is thanks to the rapid development of computational power and scalable algorithms. In this work, we used the Spectral Element Method (SEM) CFD code NekRS to simulate the randomly packed pebble bed in a cylindrical container. NekRS, which is the GPU variant of Nek5000, but refactored to utilize the computational power of GPUs using the OCCA library to run on hybrid architecture high performance computing systems. It was initially developed with the libParamunal library, but truncated and tuned for large-scale turbulence simulation. As a result, the SEM reaches higher precision with the same degrees of freedom by using a high-order Lagrange polynomial basis distributed on Gauss-Lobatto-Legendre quadrature inside each element, compared to lower-order methods, such the Finite Volume Method and Finite Element Method. The report is divided into five parts. We start with a general discussion of the pebble bed reactor, along with a specific investigation into the KP-FHR. The second part presents the numerical methodology. In the third part, we study a modular pebble bed with 1741 pebbles in a container of 7 pebble-diameter radius. Beyond LES simulations done by NekRS, we also leveraged the thermal radiation model in OpenFOAM to study heat transfer under no-forced-flow scenarios. Then, in the fourth part we simulated a pebble bed similar to the size of the Hermes Test Reactor. The total number of pebbles is in these simulations is 34,374. The container radius is 14 pebble-diameters. Finally, the report concludes in part five, with a discussion of future work.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Livermore Big Artificial Neural Network Toolkit

LBANN is a toolkit that is designed to train artificial neural networks efficiently on high performance computing architectures. It is optimized to take advantages of key High Performance Computing features to accelerate neural network training. Specifically it is optimized for low-latency, high bandwidth interconnects, node-local NVRAM, node-local GPU accelerators, and high bandwidth parallel file systems. It is built on top of the open source Elemental distributed-memory dense and spars-direct linear algebra and optimization library that is released under the BSD license. The algorithms contained within LBANN are drawn from the academic literature and implemented to work within a distributed-memory framework.

Essen, Brian Van↗

NSUF FY24 Program Overview and Updates

The Nuclear Science User Facilities (NSUF) is one of a diverse number of U.S. Department of Energy (DOE) user facilities established to provide researchers with the most advanced tools of modern science. The NSUF was established to provide access to unique capabilities to a broad range of researchers to address the important issues relevant to irradiation effects in nuclear fuels and materials. The NSUF represents a consortium of capabilities distributed across the U.S. at twenty institutions. The NSUF is centered at the Idaho National Laboratory, but it coordinates activities at nineteen “partner” institutions. These institutions have capabilities that include neutron, ion, and gamma irradiation, hot cells, advanced material characterization, and high-performance computing. The NSUF goal is to provide access these capabilities at no cost to nuclear energy researchers to produce the highest quality research results to increase understanding of advanced nuclear energy technologies important to DOE-NE.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Development of Numerical Model of Metal Foam with PCM for the Estimation of Effective Thermal Conductivity

Global warming due to climate change is a threat to humankind. Nuclear energy is one of the promising solutions to reduce fossil fuel usage. Nuclear energy can handle the base load, compensating for the volatility of renewable energy. If nuclear energy could achieve load following capability, the combination with renewable energy would be more suitable. Thermal energy storage (TES) is one of the options for enabling load following of nuclear reactors. The TES makes it possible to store surplus nuclear thermal energy and release it later as needed. In Idaho National Laboratory (INL), a new concept of latent heat TES integrated with high-temperature heat pipe has been proposed and is under development, which is called Heat pipe-Integrated Thermal Battery (HITB). HITB exchanges thermal energy between the reactor system and TES via heat pipe. The heat transferred to TES medium, made of phase change material (PCM), stores energy as sensible heat and/or latent heat. As PCM typically has poor thermal conductivity, however, various heat transfer enhancement techniques are required to achieve a rapid charging cycle. There are many techniques to enhance the heat transfer ability of TES medium such as disk, fin, and metal foam. Among them, metal foam is an appropriate option to enhance the heat transfer because it maximizes the heat transfer area through metal wicks. Metal foam is a lightweight metal structure that has a high porosity of over 0.9. The typical materials for metal foam are Aluminum, Copper, Nickel, and Silicon Carbide (SiC). Metal foam not only enhances heat transfer via conduction but also increases contact surface area. In the HITB design , the metal foam is being considered as one of the options to enhance the heat transfer of TES medium (PCM) [1]. To predict the enhanced thermal performance of TES, one should properly estimate the effective thermal conductivity of metal foam combined with PCM material or calculate heat transfer in distributed model. There are many experimental works that provides effective thermal conductivity of metal foam with various PCM [2,3]. Also, many theoretical models were developed based on the unit cell model of metal foam [4,5]. With a distributed model, on the other hand, detail heat transfer characteristics between metal foam and PCM material can be analyzed considering the geometry or buoyancy effect. However, due to the complex geometry of metal foam pores, the computational cost for three-dimensional modeling highly increases. Therefore, if metal foam structure can be modeled in simple and repetitive design, the computational cost would decrease Among the various metal foam models [2], lattice model is one of the simple and extendable design. The porosity and pores per inch (PPI) can be characterized by the size and spatial distance of lattice structure. If the three-dimensional metal foam model consists of lattice structure could properly estimate the heat transfer, which is characterized by effective thermal conductivity, it would be a good option to assess the thermal performance of metal foam with PCM. In this study, a three-dimensional numerical model was developed to simulate conductive heat transfer between metal foam and PCM. The three-dimensional lattice structure of square pillars was selected as a basic structure of the metal foam. The calculation result was characterized by the effective thermal conductivity of the whole domain. A sensitivity study was conducted for mesh size, domain size, and PPI to check whether the calculation result gives a converged result or not. Lastly, the effective thermal conductivity from the lattice model was compared with existing experimental data to validate the model result

25 ENERGY STORAGE↗

Data augmentation for disruption prediction via robust surrogate models

The goal of this work is to generate large statistically representative datasets to train machine learning models for disruption prediction provided by data from few existing discharges. Such a comprehensive training database is important to achieve satisfying and reliable prediction results in artificial neural network classifiers. Here, we aim for a robust augmentation of the training database for multivariate time series data using Student-t process regression. We apply Student-t process regression in a state space formulation via Bayesian filtering to tackle challenges imposed by outliers and noise in the training data set and to reduce the computational complexity. Thus, the method can also be used if the time resolution is high. We use an uncorrelated model for each dimension and impose correlations afterwards via coloring transformations. We demonstrate the efficacy of our approach on plasma diagnostics data of three different disruption classes from the DIII-D tokamak. To evaluate if the distribution of the generated data is similar to the training data, we additionally perform statistical analyses using methods from time series analysis, descriptive statistics, and classic machine learning clustering algorithms.

97 MATHEMATICS AND COMPUTING↗

Development of the Advanced D1S for Shutdown Dose Rate Calculations in Fusion Reactors

The assessment of the shutdown dose rate due to neutron activation is fundamental for shielding design, materials selection, licensing and planning of maintenance operations in high performances fusion devices. The shutdown dose rate calculations require the combined use of radiation transports and inventory codes. The typical approach consists in a two steps procedure. A pure neutron transport simulation is performed in a first step to calculate the spatial distribution of neutron spectra. The results are used as input for an activation calculation that provides the decay gamma source used in a second step for a pure gamma transport simulation (rigorous-two step, R2S). The Direct 1-Step (D1S) approach has been developed more than ten years ago by ENEA and the ITER team: this technique relies on a coupled neutron-decay gamma transport in a single simulation. It is based on the use of a modified version of the MCNP5 Monte Carlo code with specially tailored nuclear cross-section data for transport and FISPACT inventory code for temporal behaviour. The 'Advanced-D1S' is an improved version of D1S in which additional computational features have been introduced, such as the mesh tally capability and continuous time evolution assessment of the dose rate in single run dose. It has been validated through measurements at JET tokamak and comparison with R2S codes and a future benchmark experiment during next high performance deuterium-tritium campaign is in preparation at JET. It has also been extensively used for ITER calculations and recently applied to DEMO assessment. Present limitations and in progress code improvement strategy are described and discussed in this paper.

61 RADIATION PROTECTION AND DOSIMETRY↗

Comparison of hybrid methods for global variance reduction in shielding calculations

For Monte Carlo shielding problems that calculate a mesh tally over the entire problem, the statistical uncertainties computed for each voxel can vary widely. This can lead to unacceptably long run times in order to reduce the uncertainties in all areas of the problem to a reasonably low level. Hybrid methods - using estimates from deterministic calculations to create importance maps for variance reduction in Monte Carlo calculations - have been successfully used to optimize the calculation of specific tallies. For the global problem, several methods have been proposed to create importance maps that distribute Monte Carlo particles in such a way as to achieve a more uniform distribution of relative uncertainty across the problem. The goal is to compute a mesh tally with nearly the same relative uncertainties in the low flux/dose areas as in the high flux/dose areas. Methods based on only forward deterministic estimates and methods using both forward and adjoint deterministic methods have been implemented in the SCALE/MAVRIC package and have been compared against each other by computing global mesh tallies on several representative shielding problems. Methods using both forward and adjoint estimates provide better performance for computing more uniform relative uncertainties across a global mesh tally. (authors)

97 MATHEMATICS AND COMPUTING↗

The PetscSF Scalable Communication Layer

PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. Here, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.

97 MATHEMATICS AND COMPUTING↗

Status Report on NEAMS PROTEUS/ORIGEN Integration

The US Department of Energy’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) Program has contributed significantly to the development of the PROTEUS neutron transport code at Argonne National Laboratory and to the Oak Ridge Isotope Generation and Depletion Code (ORIGEN) depletion/decay code at Oak Ridge National Laboratory. PROTEUS’s key capability is the efficient and scalable (up to hundreds of thousands of cores) neutron transport solver on general, unstructured, three-dimensional finite-element-type meshes. The scalability and mesh generality enable the transfer of neutron and power distributions to other codes in the NEAMS toolkit for advanced multiphysics analysis. Recently, ORIGEN has received considerable modernization to provide the high-performance depletion/decay capability within the NEAMS toolkit. This work presents a description of the initial integration of ORIGEN in PROTEUS, mainly performed during FY 2015, with minor updates in FY 2016.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗

A Case Study of Truncated Electrostatics for Simulation of Polyelectrolyte Brushes on GPU Accelerators

Numerous issues have disrupted the trend for increasing computational performance with faster CPU clock frequencies. In order to exploit the potential performance of new computers, it is becoming increasingly desirable to re-evaluate computational physics methods and models with an eye towards towards approaches that allow for increased concurrency and data locality. The evaluation of long-range Coulombic interactions is a common bottleneck for molecular dynamics simulations. Enhanced truncation approaches have been proposed as an alternative method and are particularly well suited for many-core architectures and GPUs due to the inherent fine-grain parallelism that can be exploited. In this paper, we compare efficient truncation-based approximations to evaluation of electrostatic forces with the more traditional particle-particle particle-mesh (P3M) method for molecular dynamics simulation of polyelectrolyte brush layers. We show that with the use of GPU accelerators, large parallel simulations using P3M can be greater than 3 times faster due to a reduction in the mesh-size required. Alternatively, using a truncation-based scheme can improve performance even further. This approach can be up to 3.9 times faster than GPU-accelerated P3M for many polymer systems and results in accurate calculation of shear velocities and disjoining pressures for brush layers. For configurations with highly non-uniform charge distributions, however, we find that it is more efficient to use P3M; for these systems, computationally efficient parameterizations of the truncation-based approach do not produce accurate counterion density profiles or brush morphologies.

Nguyen, Trung D↗

NPTFit: A Code Package for Non-Poissonian Template Fitting

We present NPTFit, an open-source code package, written in Python and Cython, for performing non-Poissonian template fits (NPTFs). The NPTF is a recently developed statistical procedure for characterizing the contribution of unresolved point sources (PSs) to astrophysical data sets. The NPTF was first applied to Fermi gamma-ray data to provide evidence that the excess of ∼GeV gamma-rays observed in the inner regions of the Milky Way likely arises from a population of sub-threshold point sources, and the NPTF has since found additional applications studying sub-threshold extragalactic sources at high Galactic latitudes. The NPTF generalizes traditional astrophysical template fits to allow for the ability to search for populations of unresolved PSs that may follow a given spatial distribution. NPTFit builds upon the framework of the fluctuation analyses developed in X-ray astronomy, thus it likely has applications beyond those demonstrated with gamma-ray data. The NPTFit package utilizes novel computational methods to perform the NPTF efficiently. The code is available at http://github.com/bsafdi/NPTFit and up-to-date and extensive documentation may be found at http://nptfit.readthedocs.io.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated Coupled Monte Carlo-Thermal Hydraulic Calculations using a Hybrid GTF-Diffusion-based Prediction Block: First Results

Accurate predictions of spatial power and temperature distributions require the coupling of a neutron transport solver with a thermal-hydraulic (TH) feedback. Nowadays, Monte Carlo (MC) codes are widely coupled to TH solvers, typically via a Picard iteration (PI) method, due to the higher fidelity that such frameworks can produce. To speed up a PI, a prediction step can produce an improved initial guess for a source distribution and feed it to the MC code. Recent work [1, 2] investigated a prediction step that uses generalized transfer functions (GTFs) to predict the macroscopic cross sections’ variations following a perturbation in TH properties, such as coolant density. The previous method also relied on first order perturbation (FOP) theory to predict perturbed power profiles, rather than using an expensive MC iterate. The implemented FOP method relied on generating a fission matrix from which the forward and adjoint eigenmodes were extracted and later used to for power calculations. The generation of the fission matrix can introduce a significant computational overhead, therefore undermining the performance of the proposed hybrid technique when applied to high-dimensional problems, e.g., full core calculations. This work attempts to improve the GTF-FOP prediction step by replacing the FOP solver with a nodal diffusion solver, thus eliminating the need to calculate a fission matrix. The GTF-diffusion step was tested for various moderator density perturbations. In each case, the predicted power distribution showed good agreement with the reference case. The latter is attributed to the generally good prediction of most spatially distributed macroscopic cross sections, except the transport cross section, which will become the focus of future work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Machine Learning-enabled Scalable Performance Prediction of Scientific Codes

Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.

97 MATHEMATICS AND COMPUTING↗