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 919 records · Page 51

Performance and power modeling and prediction using MuMMI and 10 machine learning methods

Energy-efficient scientific applications require insight into how high performance computing system features impact the applications' power and performance. This insight can result from the development of performance and power models. Here, in this article, we use the modeling and prediction tool MuMMI (Multiple Metrics Modeling Infrastructure) and 10 machine learning methods to model and predict performance and power consumption and compare their prediction error rates. We use an algorithm-based fault-tolerant linear algebra code and a multilevel checkpointing fault-tolerant heat distribution code to conduct our modeling and prediction study on the Cray XC40 Theta and IBM BG/Q Mira at Argonne National Laboratory and the Intel Haswell cluster Shepard at Sandia National Laboratories. Our experimental results show that the prediction error rates in performance and power using MuMMI are less than 10% for most cases. By utilizing the models for runtime, node power, CPU power, and memory power, we identify the most significant performance counters for potential application optimizations, and we predict theoretical outcomes of the optimizations. Based on two collected datasets, we analyze and compare the prediction accuracy in performance and power consumption using MuMMI and 10 machine learning methods.

97 MATHEMATICS AND COMPUTING↗

Learning likelihood ratios with neural network classifiers

The likelihood ratio is a crucial quantity for statistical inference in science that enables hypothesis testing, construction of confidence intervals, reweighting of distributions, and more. Many modern scientific applications, however, make use of data- or simulation-driven models for which computing the likelihood ratio can be very difficult or even impossible. By applying the so-called “likelihood ratio trick,” approximations of the likelihood ratio may be computed using clever parametrizations of neural network-based classifiers. A number of different neural network setups can be defined to satisfy this procedure, each with varying performance in approximating the likelihood ratio when using finite training data. We present a series of empirical studies detailing the performance of several common loss functionals and parametrizations of the classifier output in approximating the likelihood ratio of two univariate and multivariate Gaussian distributions as well as simulated high-energy particle physics datasets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Guidelines for creating artificial neural network empirical interatomic potential from first-principles molecular dynamics data under specific conditions and its application to $α$-Ag 2 Se

First-principles molecular dynamics (FPMD) simulations are highly accurate, but due to their high calculation cost, the computational scale is often limited to hundreds of atoms and few picoseconds under specific temperature and pressure conditions. As such, we present here the guidelines for creating artificial neural network empirical interatomic potential (ANN potential) trained with such a limited FPMD data, which can perform long time scale MD simulations at least under the same conditions. The FPMD data for training are prepared on the basis of the convergence of radial distribution function [$g(r)$]. While training the ANN using total energy and atomic forces of the FPMD data, the error of pressure is also monitored and minimized. To create further robust potential, we add a small amount of FPMD data to reproduce the interaction between two atoms that are close to each other. ANN potentials for $α$-Ag 2 Se were created as an application example, and it has been confirmed that not only $g(r)$ and mean square displacements but also the specific heat requiring a long time scale simulation matched the FPMD and the experimental values. In addition, the MD simulation using the ANN potential achieved over 10 4 acceleration over the FPMD one. The guidelines proposed here mitigate the creation difficulty of the ANN potential, and a lot of FPMD data sleeping on the hard disk after the research may be put on the front stage again.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CHARM-SYCL & IRIS: A Tool Chain for Performance Portability on Extremely Heterogeneous Systems

Performance portability is becoming crucial as high-performance computing systems become increasingly heterogeneous. We have many options for CPUs and accelerators (e.g., GPUs) but also for non-Von Neumann architectures such as field-programmable gate arrays. This paper presents the CHARM-SYCL unified programming environment for multiple accelerator types as a performance-portable programming environment. It uses the IRIS library developed at Oak Ridge National Laboratory as the back end accelerator runtime. IRIS has a high-performance scheduler to distribute tasks across accelerators. This design allows us to run an application from the same source on multiple systems with multiple configurations. We provide three types of portability with CHARM-SYCL: Portable Workflow, Compiler and Runtime Portability, and Application and Performance Portability. We implement a Monte Carlo simulation benchmark code on the CHARM-SYCL execution environment and demonstrate that our programming environment can accommodate extremely heterogeneous systems.

Fujita, Norihisa↗

System Administration Tools

High Performance Computing clusters and supercomputers are expensive and complex systems to manage. The software tools to manage these systems are also aging to the point where they are no longer actively developed and their methodology is antiquated. There has been a surge of new methodologies and software tools developed by the cloud providers to maximize availability of services and scalability of server deployment. The authors would like to utilize these new software tools to distribute our proof of concept, named Kraken, that will be responsible for booting and managing LANL's HPC systems in the future

Peltz, Paul↗

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.↗

Validation of RANS Models for Predicting Bypass Flow in Prismatic VHTRs

In prismatic Very-High Temperature Reactors (VHTRs), gaps occur between neighboring fuel assemblies referred to as bypass gaps. This work aims to measure the flow distribution between the bypass gaps between neighboring assemblies and the coolant channels within the assemblies. Computational fluid dynamics (CFD) was done using Reynolds-Averaged Navier Stokes (RANS) modeling in STAR-CCM+ to assess the ability of RANS models to accurately capture this phenomena. The RANS results were compared to experimental worked performed by Seoul National University (SNU) and Korea Atomic Energy Research Institute (KAERI) for validation. The CFD results showed good comparison with the experimental data available from SNU and flow split was characterized for multiple configurations, inlet mass flow rates, and bypass gap sizes.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Simulations of Bypass Flow in Prismatic VHTRs

In prismatic Very-High Temperature Reactors (VHTRs), gaps occur between neighboring fuel assemblies referred to as bypass gaps. This work aims to measure the flow distribution between the bypass gaps between neighboring assemblies and the coolant channels within the assemblies. Computational fluid dynamics (CFD) was done using Reynolds-Averaged Navier Stokes (RANS) modeling in STAR-CCM+ to assess the ability of RANS models to accurately capture this phenomena. The RANS results were compared to experimental worked performed by Seoul National University (SNU) and Korea Atomic Energy Research Institute (KAERI) for validation. The CFD results showed good comparison with the experimental data available from SNU and flow split was characterized for multiple configurations, inlet mass flow rates, and bypass gap sizes.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗

Real-Time Regional PV Spinning Reserve Estimator with AGC Look-Ahead Windows

Curtailed PV generation is a zero-marginal cost spinning reserve that can be used for a number of active power control services. However, unlike the traditional spinning reserve providers, i.e., fossil-fueled generators, who have well-defined operating characteristics, e.g., available headroom or potential high limit (PHL), PV plants have by nature variable and uncertain operating characteristics. To ensure the effective coordination between PV plants and the system operator during an active power control event, accurate forecasts of the PV PHL are essential. A novel reference-control grouping based scaling method has been proposed by NREL to estimate the PV PHL in real-time. This work further enhances the methodology by: 1) improving the model accuracy through machine learning; 2) considering look-ahead windows introduced by the computation and communication latencies; 3) applying the method to regional spinning reserve estimation. A significant performance improvement, over 99% of estimation error reduction, has been observed based on real-world data collected by CAISO and PV plant operators.

potential high limit↗

Real-Time Regional PV Spinning Reserve Estimator with AGC Look-Ahead Windows: Preprint

Curtailed PV generation is a zero-marginal cost spinning reserve that can be used for a number of active power control services. However, unlike the traditional spinning reserve providers, i.e., fossil-fueled generators, who have well-defined operating characteristics, e.g., available headroom or potential high limit (PHL), PV plants have by nature variable and uncertain operating characteristics. To ensure the effective coordination between PV plants and the system operator during an active power control event, accurate forecasts of the PV PHL are essential. A novel reference-control grouping based scaling method has been proposed by NREL to estimate the PV PHL in real-time. This work further enhances the methodology by: 1) improving the model accuracy through machine learning; 2) considering look-ahead windows introduced by the computation and communication latencies; 3) applying the method to regional spinning reserve estimation. A significant performance improvement, over 1.6% of estimation error reduction, has been observed based on real-world data collected by CAISO and PV plant operators.

potential high limit↗

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗

High-resolution Compton spectroscopy using x-ray microcalorimeters

X-ray Compton spectroscopy is one of the few direct probes of the electron momentum distribution of bulk materials in ambient and operando environments. Herein, we report high-resolution inelastic x-ray scattering experiments with high momentum and energy transfer performed at a storage-ring-based high-energy x-ray light source facility using an x-ray transition-edge sensor (TES) microcalorimeter detector. The performance was compared with a silicon drift detector (SDD), an energy-resolving semiconductor detector, and Compton profiles were measured for lithium and cobalt oxide powders relevant to lithium-ion battery research. Spectroscopic analysis of the measured Compton profiles demonstrates the high-sensitivity to the low- Z elements and oxidation states. The line shape analysis of the measured Compton profiles in comparison with computed Hartree–Fock profiles is usually limited by the resolution of the semiconductor detector. We have characterized an x-ray TES microcalorimeter detector for high-resolution Compton scattering experiments using a bending magnet source at the Advanced Photon Source with a double crystal monochromator, providing monochromatic photon energies near 27.5 keV. The momentum resolution below 0.16 atomic units (a.u.) was measured, yielding an improvement of more than a factor of 7 over a state-of-the-art SDD for the same scattering geometry. Furthermore, the lineshapes of narrow valence and broad core electron profiles of sealed lithium metal were clearly resolved using an x-ray TES compared to smeared and broadened lineshapes observed when using the SDD. High-resolution Compton scattering using the energy-resolving area detector shown here presents new opportunities for spatial imaging of electron momentum distributions for a wide class of materials with applications ranging from electrochemistry to condensed matter physics.

47 OTHER INSTRUMENTATION↗

Unified aeroacoustics analysis for high speed turboprop aerodynamics and noise. Volume 3: Application of theory for blade loading, wakes, noise, and wing shielding

Results of the program for the generation of a computer prediction code for noise of advanced single rotation, turboprops (prop-fans) such as the SR3 model are presented. The code is based on a linearized theory developed at Hamilton Standard in which aerodynamics and acoustics are treated as a unified process. Both steady and unsteady blade loading are treated. Capabilities include prediction of steady airload distributions and associated aerodynamic performance, unsteady blade pressure response to gust interaction or blade vibration, noise fields associated with thickness and steady and unsteady loading, and wake velocity fields associated with steady loading. The code was developed on the Hamilton Standard IBM computer and has now been installed on the Cray XMP at NASA-Lewis. The work had its genesis in the frequency domain acoustic theory developed at Hamilton Standard in the late 1970s. It was found that the method used for near field noise predictions could be adapted as a lifting surface theory for aerodynamic work via the pressure potential technique that was used for both wings and ducted turbomachinery. In the first realization of the theory for propellers, the blade loading was represented in a quasi-vortex lattice form. This was upgraded to true lifting surface loading. Originally, it was believed that a purely linear approach for both aerodynamics and noise would be adequate. However, two sources of nonlinearity in the steady aerodynamics became apparent and were found to be a significant factor at takeoff conditions. The first is related to the fact that the steady axial induced velocity may be of the same order of magnitude as the flight speed and the second is the formation of leading edge vortices which increases lift and redistribute loading. Discovery and properties of prop-fan leading edge vortices were reported in two papers. The Unified AeroAcoustic Program (UAAP) capabilites are demonstrated and the theory verified by comparison with the predictions with data from tests at NASA-Lewis. Steady aerodyanmic performance, unsteady blade loading, wakes, noise, and wing and boundary layer shielding are examined.

Hanson, D. B.↗

An uncertainty quantification method relevant to material test reactors

Within material test reactor calculations, energy dependent flux and reaction rate uncertainties are typically not quantified when performing as-run analyses to determine the neutron field experienced by the experiment. When high fidelity Monte-Carlo codes are used in such analyses, straight forward methods to calculate output uncertainties are not available, instead expert opinion is used to postulate computational uncertainties. New methods to propagate uncertainties through these high fidelity simulations are available when sufficient computational power is available. A tool is developed here for sampling any part of an MCNP input from random distributions to determine output uncertainties based on those inputs. Another tool is developed to sample nuclear data cross-section in ACE format using multi-group nuclear data covariances. The Total Monte-Carlo Method and Gesellschaft für Anlagen-und Reaktorsicherheit method (GRS) are implemented and compared to one another as well as MCNP sensitivity and uncertainty calculations. The methods were applied to the Godiva critical sphere k-eigenvalue, the UAM pin-cell benchmark energy dependent flux and reaction rates, and the Advanced Test Reactor energy dependent flux within an experimental location. Furthermore, the two methods agree well, with GRS allowing for an order of magnitude speedup for reaction rate uncertainty calculations and several orders of magnitude for eigenvalue uncertainty calculations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Iterative self-organizing SCEne-LEvel sampling (ISOSCELES) for large-scale building extraction

Convolutional neural networks (CNN) provide state-of-the-art performance in many computer vision tasks, including those related to remote-sensing image analysis. Successfully training a CNN to generalize well to unseen data, however, requires training on samples that represent the full distribution of variation of both the target classes and their surrounding contexts. With remote sensing data, acquiring a sufficiently representative training set is a challenge due to both the inherent multi-modal variability of satellite or aerial imagery and the general high cost of labeling data. To address this challenge, we have developed ISOSCELES, an Iterative Self-Organizing SCEne LEvel Sampling method for hierarchical sampling of large image sets. Using affinity propagation, ISOSCELES automates the selection of highly representative training images. Compared to random sampling or using available reference data, the distribution of the training is principally data driven, reducing the chance of oversampling uninformative areas or undersampling informative ones. In comparison to manual sample selection by an analyst, ISOSCELES exploits descriptive features, spectral and/or textural, and eliminates human bias in sample selection. Using a hierarchical sampling approach, ISOSCELES can obtain a training set that reflects both between-scene variability, such as in viewing angle and time of day, and within-scene variability at the level of individual training samples. We verify the method by demonstrating its superiority to stratified random sampling in the challenging task of adapting a pre-trained model to a new image and spatial domain for country-scale building extraction. Using a pair of hand-labeled training sets comprising 1,987 sample image chips, a total of 496,000,000 individually labeled pixels, we show, across three distinct model architectures, an increase in accuracy, as measured by F1-score, of 2.2–4.2%.

42 ENGINEERING↗

A kinetic-based regularization method for data science applications

We propose a physics-based regularization technique for function learning, inspired by statistical mechanics. By drawing an analogy between optimizing the parameters of an interpolator and minimizing the energy of a system, we introduce corrections that impose constraints on the lower-order moments of the data distribution. This minimizes the discrepancy between the discrete and continuum representations of the data, in turn allowing to access more favorable energy landscapes, thus improving the accuracy of the interpolator. Our approach improves performance in both interpolation and regression tasks, even in high-dimensional spaces. Unlike traditional methods, it does not require empirical parameter tuning, making it particularly effective for handling noisy data. We also show that thanks to its local nature, the method offers computational and memory efficiency advantages over Radial Basis Function interpolators, especially for large datasets.

97 MATHEMATICS AND COMPUTING↗

Faster than Real-Time Dynamic Simulation for Large-Size Power System with Detailed Dynamic Models using High-Performance Computing Platform

This paper presents a faster-than-real-time dynamic simulation software package that is designed for large-size power system dynamic simulation. It was developed on the GridPACKTM high-performance computing (HPC) framework. The key features of the developed software package include (1) faster-than-real-time dynamic simulation for a WECC system (17,000 buses) with different types of detailed generator, controller, and relay dynamic models, (2) a decoupled parallel dynamic simulation algorithm with optimized computation architecture to better leverage HPC resources and technologies, (3) options for HPC-based linear and iterative solvers, (4) hidden HPC details, such as data communication and distribution, to enable development centered on mathematical models and algorithms rather than on computational details for power system researchers, and (5) easy integration of new dynamic models and related algorithms into the software package.

Huang, Renke↗