Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cluster 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Data Storage for HEP Experiments in the Era of High-Performance Computing

As particle physics experiments push their limits on both the energy and the intensity frontiers, the amount and complexity of the produced data are also expected to increase accordingly. With such large data volumes, next-generation efforts like the HL-LHC and DUNE will rely even more on both high-throughput (HTC) and high-performance (HPC) computing clusters. Full utilization of HPC resources requires scalable and efficient data-handling and I/O. For the last few decades, ROOT has been used by most HEP experiments to store data. However, other storage technologies like HDF5 may perform better in HPC environments. Initial explorations with HDF5 have begun using ATLAS, CMS and DUNE data; the DUNE experiment has also adopted HDF5 for its data-acquisition system. This paper presents the future outlook of the HEP computing and the role of HPC, and a summary of ongoing and future works to use HDF5 as a possible data storage technology for the HEP experiments to use in HPC environments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Enabling Pulse-level Programming, Compilation, and Execution in XACC

Noisy gate-model quantum processing units (QPUs) are currently available from vendors over the cloud, and digital quantum programming approaches exist to run low-depth circuits on physical hardware. These digital representations are ultimately lowered to pulse-level instructions by vendor quantum control systems to affect unitary evolution representative of the submitted digital circuit. Vendors are beginning to open this pulse-level control system to the public via specified interfaces. Robust programming methodologies, software frameworks, and backend simulation technologies for this analog model of quantum computation will prove critical to advancing pulse-level control research and development. Prototypical use cases for this include error mitigation, optimal pulse control, and physics-inspired pulse construction. Here we present an extension to the XACC quantum-classical software framework that enables pulse-level programming for superconducting, gate-model quantum computers, and a novel, general, and extensible pulse-level simulation backend for XACC that scales on classical compute clusters via MPI. Our work enables custom backend Hamiltonian definitions and gate-level compilation to available pulses with a focus on performance and scalability. We end with a demonstration of this capability, and show how to use XACC for pertinent pulse-level programming tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An Extension of the Athena++ Code Framework for Radiation-magnetohydrodynamics in General Relativity Using a Finite-solid-angle Discretization

We extend the general-relativistic magnetohydrodynamics (GRMHD) capabilities of Athena++ to incorporate radiation. The intensity field in each finite-volume cell is discretized in angle, with explicit transport in both space and angle properly accounting for the effects of gravity on null geodesics, and with matter and radiation coupled in a locally implicit fashion. Here we describe the numerical procedure in detail, verifying its correctness with a suite of tests. Motivated in particular by black hole accretion in the high-accretion-rate, thin-disk regime, we demonstrate the application of the method to this problem. With excellent scaling on flagship computing clusters, the port of the algorithm to the GPU-enabled AthenaK code now allows the simulation of many previously intractable radiation-GRMHD systems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Thermal Management for FPGA Nodes in HPC Systems

The integration of FPGAs into large-scale computing systems is gaining attention. In these systems, real-time data handling for networking, tasks for scientific computing, and machine learning can be executed with customized datapaths on reconfigurable fabric within heterogeneous compute nodes. At the same time, thermal management, particularly battling the cooling cost and guaranteeing the reliability, is a continuing concern. The introduction of new heterogeneous components into HPC nodes only adds further complexities to thermal modeling and management. The thermal behavior of multi-FPGA systems deployed within large compute clusters is less explored. Here, we first show that the thermal behaviors of different FPGAs of the same generation can vary due to their physical locations in a rack and process variation, even though they are running the same tasks. We present a machine learning–based model to capture the thermal behavior of each individual FPGA in the cluster. We then propose two thermal management strategies guided by our thermal model. First, we mitigate thermal variation and hotspots across the cluster by proactive thermal-aware task placement. Under the tested system and benchmarks, we achieve up to 26.4° C and on average 13.3° C system temperature reduction with no performance penalty. Second, we utilize this thermal model to guide HLS parameter tuning at the task design stage to achieve improved thermal response after deployment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Ocelot: An Interactive, Efficient Distributed Compression-As-a-Service Platform With Optimized Data Compression Techniques

Large volumes of data generated by scientific simulations, genome sequencing, and other applications need to be moved among clusters for data collection/analysis. Data compression techniques have effectively reduced data storage and transfer costs. However, users' requirements on interactively controlling both data quality and compression ratios are non-trivial to fulfill. Here, we propose a novel Compression-as-a-Service (CaaS) platform called Ocelot with four important contributions: (1) It offers real-time visualization, interactive compression, and transfer of scientific datasets. (2) It incorporates new strategies for compressing diverse types of datasets more effectively than traditional methods. (3) It provides an effective method for estimating the compression ratio and execution time of compression tasks. (4) Experiments on multiple real-world datasets on geographically distributed computers show that Ocelot can significantly improve data transfer efficiency with a performance gain of more than 10x in computing clusters with relatively slow networks.

compression as a service (CaaS)↗
DOE OSTI2020

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Harnessing distributed GPU computing for generalizable graph convolutional networks in power grid reliability assessments

Although machine learning (ML) has emerged as a powerful tool for rapidly assessing grid contingencies, prior studies have largely considered a static grid topology in their analyses. This limits their application, since they need to be re-trained for every new topology. Here, this paper explores the development of generalizable graph convolutional network (GCN) models by pre-training them across a range of grid topologies and contingency types. We found that a GCN model with auto-regressive moving average (ARMA) layers with a line graph representation of the grid offered the best predictive performance in predicting voltage magnitudes (VM) and voltage angles (VA). We introduced the concept of phantom nodes to consider disparate grid topologies with a varying number of nodes and lines. For pre-training the GCN ARMA model across a variety of topologies, distributed graphics processing unit (GPU) computing afforded us significant training scalability. The predictive performance of this model on grid topologies that were part of the training data is substantially better than the direct current (DC) approximation. Although direct application of the pre-trained model to topologies that are not part of the grid is not particularly satisfactory, fine-tuning with small amounts of data from a specific topology of interest significantly improves predictive performance. In general, this paper highlights the feasibility of training large-scale GNN models to assess the reliability of power grids by considering a wide variety of grid topologies and contingency types. With the advent of foundational models in ML and the exponential increase in GPU computing clusters, generalizable ML models will significantly enhance how utilities manage power systems and make decisions in real-time or near-real-time.

24 - POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Automated pipeline framework for processing of large-scale building energy time series data

Commercial buildings account for one third of the total electricity consumption in the United States and a significant amount of this energy is wasted. Therefore, there is a need for “virtual” energy audits, to identify energy inefficiencies and their associated savings opportunities using methods that can be non-intrusive and automated for application to large populations of buildings. Here we demonstrate virtual energy audits applied to large populations of buildings’ time-series smart-meter data using a systematic approach and a fully automated Building Energy Analytics (BEA) Pipeline that unifies, cleans, stores and analyzes building energy datasets in a non-relational data warehouse for efficient insights and results. This BEA pipeline is based on a custom compute job scheduler for a high performance computing cluster to enable parallel processing of Slurm jobs. Within the analytics pipeline, we introduced a data qualification tool that enhances data quality by fixing common errors, while also detecting abnormalities in a building’s daily operation using hierarchical clustering. We analyze the HVAC scheduling of a population of 816 buildings, using this analytics pipeline, as part of a cross-sectional study. With our approach, this sample of 816 buildings is improved in data quality and is efficiently analyzed in 34 minutes, which is 85 times faster than the time taken by a sequential processing. The analytical results for the HVAC operational hours of these buildings show that among 10 building use types, food sales buildings with 17.75 hours of daily HVAC cooling operation are decent targets for HVAC savings. Overall, this analytics pipeline enables the identification of statistically significant results from population based studies of large numbers of building energy time-series datasets with robust results. These types of BEA studies can explore numerous factors impacting building energy efficiency and virtual building energy audits. This approach enables a new generation of data-driven buildings energy analysis at scale.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Spotlight: efficient automated global optimization in rietveld analysis of diffraction data

Performing reliable Rietveld analysis on tens or hundreds of powder diffraction datasets from parametric or time-resolved experiments often poses a bottleneck in extracting meaningful results from the data. While automated analysis of data has recently been demonstrated, high temperature annealing studies, during which phase transformations occur and lattice parameters may change due to repartitioning of elements, are prime examples where automation by a simple phase identification from a database of room temperature structures or automation by sequential refinements is likely to fail. To enable reliable, efficient, automated Rietveld analysis, we present a Python package named Spotlight , building on established Rietveld packages such as MAUD, GSAS , or GSAS-II , which extends the refinement of best fit parameters to a global optimization using an ensemble of optimizers leveraging hierarchical parallel execution on high-performance computing clusters. Spotlight further enables the efficient design of refinement plans through the iterative automated machine-learning of a surrogate for the refinement on which the global optimizations are performed until results from the surrogate converge to the response surface data. We demonstrate Spotlight with the analysis of uranium molybdenum and Ti–6Al–4V datasets, as well as in two open-source tutorials analyzing aluminium oxide and lead sulphate.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Metabolic Pathway Engineering

Modern microbial and enzyme engineering and their advancement are increasingly dependent on the marriage of a wide range of sophisticated technologies. For students entering the field of biotechnology, the outlook is indeed daunting. Expertise at levels beyond that of simple familiarity will be needed to conduct competitive research. It goes without saying that to be competitive, all new researchers in this field will need basic preparation in molecular biology, biochemistry, and genetics. Further, experience working with concepts and experimental tools in enzyme biochemistry and kinetics, gene editing, computational metabolic pathway modeling, experimental pathway flux analysis, and computational clustering tools to process complex data sets will be vital for success. We speculate that most biotechnology researchers in early career at this time will build teams of collaborators to address these disparate science fields rather than attempt to become experts in one lab.

BASIC BIOLOGICAL SCIENCES,BIOMASS FUELS↗
DOE OSTI2021

The CH(X 2 Π) + H 2 O reaction: two transition state kinetics

he reaction of ground state methylidyne (CH) with water vapor (H 2 O) is theoretically re-investigated using high-level coupled cluster computations in combination with semi-classical transition state theory (SCTST) and two-dimensional master equation simulations. Insertion of CH into a H–O bond of H 2 O over a submerged barrier via a well-skipping mechanism yielding solely H and CH 2 O is characterized. The reaction kinetics is effectively determined by the formation of a pre-reaction van der Waals complex (PRC, HC—OH 2 ) and its subsequent isomerization to activated CH 2 OH in competition with PRC re-dissociation. The tunneling effects are found to be minor, while variational effects in the PRC → CH 2 OH step are negligible. The calculated rate coefficient k ( T ) is nearly pressure-independent, but strongly depends on temperature with pronounced down-up behavior: a high value of 2 x 10 -10 cm 3 s -1 at 50 K, followed by a fairly steep decrease down to 8 × 10 -12 cm 3 s -1 at 900 K, but increasing again to 5 × 10 -11 cm 3 s -1 at 3500 K. Over the T-range of this work, k ( T ) can be expressed as: k ( T , P = 0) = 2.31 × 10 -11 ( T /300 K) -1.615 exp(-38.45/ T ) cm 3 s -1 for T = 50-400 K k ( T , P = 0) = 1.15 × 10 -12 ( T /300 K) 0.8637 exp(892.6/ T ) cm 3 s -1 for T = 400-1000 K k ( T , P = 0) = 4.57 × 10 -15 ( T /300 K) 3.375 exp(3477.4/ T ) cm 3 s -1 for T = 1000–3500 K.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

BeyondPlanck: XII. Cosmological parameter constraints with end-to-end error propagation

We present cosmological parameter constraints estimated using the Bayesian BEYONDPLANCK analysis framework. This method supports seamless end-to-end error propagation from raw time-ordered data onto final cosmological parameters. As a first demonstration of the method, we analyzed time-ordered Planck LFI observations, combined with selected external data (WMAP 33–61 GHz, Planck HFI DR4 353 and 857 GHz, and Haslam 408 MHz) in the form of pixelized maps that are used to break critical astrophysical degeneracies. Overall, all the results are generally in good agreement with previously reported values from Planck 2018 and WMAP, with the largest relative difference for any parameter amounting about 1σ when considering only temperature multipoles between 30 ≤ ℓ ≤ 600. In cases where there are differences, we note that the BEYONDPLANCK results are generally slightly closer to the high-ℓ HFI-dominated Planck 2018 results than previous analyses, suggesting slightly less tension between low and high multipoles. Using low-ℓ polarization information from LFI and WMAP, we find a best-fit value of τ = 0.066 ± 0.013, which is higher than the low value of τ = 0.052 ± 0.008 derived from Planck 2018 and slightly lower than the value of 0.069 ± 0.011 derived from the joint analysis of official LFI and WMAP products. Most importantly, however, we find that the uncertainty derived in the BEYONDPLANCK processing is about 30 % greater than when analyzing the official products, after taking into account the different sky coverage. We argue that this uncertainty is due to a marginalization over a more complete model of instrumental and astrophysical parameters, which results in more reliable and more rigorously defined uncertainties. We find that about 2000 Monte Carlo samples are required to achieve a robust convergence for a low-resolution cosmic microwave background (CMB) covariance matrix with 225 independent modes, and producing these samples takes about eight weeks on a modest computing cluster with 256 cores.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Deep-learning-enabled Bayesian inference of fuel magnetization in magnetized liner inertial fusion

Fuel magnetization in magneto-inertial fusion (MIF) experiments improves charged burn product confinement, reducing requirements on fuel areal density and pressure to achieve self-heating. By elongating the path length of 1.01 MeV tritons produced in a pure deuterium fusion plasma, magnetization enhances the probability for deuterium–tritium reactions producing 11.8-17.1 MeV neutrons. Nuclear diagnostics thus enable a sensitive probe of magnetization. Characterization of magnetization, including uncertainty quantification, is crucial for understanding the physics governing target performance in MIF platforms, such as magnetized liner inertial fusion (MagLIF) experiments conducted at Sandia National Laboratories, Z-facility. We demonstrate a deep-learned surrogate of a physics-based model of nuclear measurements. A single model evaluation is reduced from O ( 10 – 100 ) (10–100) CPU hours on a high-performance computing cluster down to O ( 10 – 100 ) (10) ms on a laptop. This enables a Bayesian inference of magnetization, rigorously accounting for uncertainties from surrogate modeling and noisy nuclear measurements. The approach is validated by testing on synthetic data and comparing with a previous study. We analyze a series of MagLIF experiments systematically varying preheat, resulting in the first ever systematic experimental study of magnetic confinement properties of the fuel plasma as a function of fundamental inputs on any neutron-producing MIF platform. We demonstrate that magnetization decreases from B R ∼ 0.2 ~0.5 to B R ∼ 0.2 ~0.2 MG cm as laser preheat energy deposited increases from E preheat ∼ 460 ~460 J to E preheat ∼ 460 ~1.4 kJ. This trend is consistent with 2D LASNEX simulations showing Nernst advection of the magnetic field out of the hot fuel and diffusion into the target liner.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Nuclear short-range correlations and the zero-energy eigenstates of the Schrödinger equation

Here, we present a systematic analysis of the nuclear two- and three-body short-range correlations and their relations to the zero-energy eigenstates of the Schrödinger equation. To this end we analyze the doublet and triplet coupled-cluster amplitudes in the high momentum limit, and show that they obey universal equations independent of the number of nucleons and their state. Furthermore, we find that these coupled-cluster amplitudes coincide with the zero-energy Bloch-Horowitz operator. These results illuminate the relations between the nuclear many-body theory and the generalized contact formalism, introduced to describe the nuclear two-body short range correlations, and they might also be helpful for general coupled-cluster computations as the asymptotic part of the amplitudes is given and shown to be universal.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Spatiotemporal mapping of mesoscopic liquid dynamics

The study of liquid dynamics at mesoscopic scales is still strewn with difficulty due to limitations in theory and experiment. Historically, significant attention has been given to the analysis of space-time correlation functions and their frequency-Fourier transforms at a few discrete wave numbers. The massive computing power afforded by modern high performance computing clusters and the advent of a wide-angle neutron spin-echo spectrometer, however, have unlocked a more intuitive and fruitful approach to this problem. Using molecular dynamics simulations, here we demonstrate the benefits of spatiotemporally mapping intermediate scattering functions on a dense grid of correlation times and wave numbers. Four model systems are investigated: a Lennard-Jones liquid, a coarse-grained bead-spring polymer, a molten sodium chloride, and a poly(ethylene oxide) melt. We show that the spatiotemporal mapping approach is particularly useful for elucidating the mesoscopic dynamics in these liquids, where several underlying mechanisms, such as molecular relaxations, hydrodynamic modes, and nonhydrodynamic excitations, are potentially at play. Therefore, compared to the traditional method, direct visualization of density space-time correlation functions on two-dimensional color maps permits appraisals of complicated dynamical behavior at mesoscales in a global manner. For example, the scaling relations between space and time for different types of molecular motions can be straightforwardly identified on these plots, without any model-dependent analysis. Additionally, we show how theoretical ideas regarding collective mesoscopic dynamics, such as the classical hydrodynamic theory, the convolution approximation, and a recently proposed phenomenological model, can be discussed in terms of the global features of spatiotemporal maps of intermediate scattering functions. The new perspective offered by the spatiotemporal mapping method should prove useful for the study of liquid dynamics in general.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Two-Neutron Halo is Unveiled in F 29

Here, we report the measurement of reaction cross sections ( σ R ex ) of F 27 , 29 with a carbon target at RIKEN. The unexpectedly large σ R ex and derived matter radius identify F 29 as the heaviest two-neutron Borromean halo to date. The halo is attributed to neutrons occupying the 2 p 3 / 2 orbital, thereby vanishing the shell closure associated with the neutron number N = 20 . The findings are explained by state-of-the-art shell model calculations. Coupled-cluster computations based on effective field theories of the strong nuclear force describe the matter radius of F 27 but are challenged for F 29 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

PV Hosting Capacity Estimation: Experiences with Scalable Framework

Hosting capacity is an indication of the amount of solar photovoltaics (PV) that can be hosted in a distribution system without additional changes to infrastructure or oper-ations. This paper presents a framework for estimating the PV hosting capacity at scale. First, we analyze computational, modeling and other key challenges of performing relevant, large-scale simulations, provided along with the experiences and lessons learned. Then, we develop two open-source Python-based software tools to conduct repeatable distribution analyses: the Distribution Integration Solution Cost Options (DISCO) for configuring and analyzing simulations and the Job Automation and Deployment Engine (JADE) for parallelizing jobs on high-performance computing clusters. A case study of hosting capacity estimation for the SMART-DS San Francisco (SFO) 2000+ synthetic feeders, is used to demonstrate the capability of the developed DISCO+JADE framework and tools. The framework and tools can help utilities assess the overall hosting capacity of their service territory, which can help them better plan for the overall upgrade costs to integrate more PV in the future. The experiences are shared to aid the tool users and researchers to conduct relevant studies and research.

distributed energy resources↗