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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2022

UPC++ v1.0 Programmer’s Guide (Revision 2022.3.0)

UPC++ is a C++ library that supports Partitioned Global Address Space (PGAS) programming. It is designed for writing efficient, scalable parallel programs on distributed-memory parallel computers. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). The UPC++ control model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. The PGAS memory model additionally provides one-sided RMA communication to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. UPC++ was designed to support exascale high-performance computing, and the library interfaces and implementation are focused on maximizing scalability. In UPC++, all communication operations are syntactically explicit, which encourages programmers to consider the costs associated with communication and data movement. Moreover, all communication operations are asynchronous by default, encouraging programmers to seek opportunities for overlapping communication latencies with other useful work. UPC++ provides expressive and composable abstractions designed for efficiently managing aggressive use of asynchrony in programs. Together, these design principles are intended to enable programmers to write applications using UPC++ that perform well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

UPC++ v1.0 Programmer’s Guide, Revision 2023.3.0

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

UPC++ v1.0 Programmer’s Guide, Revision 2022.9.0

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

CT imaging during microwave ablation: Analysis of spatial and temporal tissue contraction

Purpose: To analyze the spatial distribution and temporal development of liver tissue contraction during high-temperature ablation by using intraprocedural computed tomography (CT) imaging. Methods: A total of 46 aluminum fiducial markers were positioned in a 60 × 45 mm grid, in a single plane, around a microwave ablation antenna in each of six ex vivo bovine liver samples. Ablations were performed for 10 min at 100 W. CT data of the liver sample were acquired every 30 s during ablation. Fiducial motion between acquisitions was tracked in postprocessing and used to calculate measures of tissue contraction and contraction rates. The spatial distribution and temporal evolution of contraction were analyzed. Results: Fiducial displacement indicated that the zone measured postablation was 8.2 ± 1.8 mm (∼20%) smaller in the radial direction and 7.1 ± 1.0 mm (∼10%) shorter in the longitudinal direction than the preablation tissue dimension. Therefore, the total ablation volume was reduced from its preablation value by approximately 45%. Very little longitudinal contraction was noted in the distal portion of the ablation zone. Central tissues contracted more than 60%, which was near an estimated limit of ∼70% based on initial water content. More peripheral tissues contracted only 15% in any direction. Contraction rates peaked during the first 60 s of heating with a roughly exponential decay over time. Conclusions: Ablation zones measured posttreatment are significantly smaller than the pretreatment tissue dimensions. Tissue contraction is spatially dependent, with the greatest effect occurring in the central ablation zone. Contraction rate peaks early and decays over time.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2026

Techno-Economic Assessment of Data Center Load Demand Powered by Small Modular Reactors and Distributed Energy Resources

The rapid increase in data center energy demand, driven by AI and large-scale data processing, poses significant challenges to global energy infrastructure. Data centers require substantial and reliable energy for continuous operations and high-performance computing. Current electrical grids face issues such as transmission bottlenecks and aging infrastructure, making it difficult to meet these demands. Integrating inverter-based-resources (IBRs) like solar and wind presents both opportunities and challenges due to their intermittent nature. Small Modular Reactors (SMRs) offer a promising solution with their enhanced safety, modularity, reliability, and scalability, providing consistent base load power ideal for data center operations. This study presents a comprehensive techno-economic assessment of powering data center load demand using a combination of SMRs and IBRs with grid-connected and islanded mode. This study utilized Idaho National Laboratory’s (INL) HPC data center hourly load profiles and Xendee microgrid optimization platform to conduct the analysis. In this configuration, SMRs serves as the primary base load power source, consistently providing a steady supply of electricity necessary to meet the minimum load demand of the data center with support from the IBRs. Key performance indicators such as Levelized Cost of Electricity (LCOE), Net Present Value (NPV) has been calculated to assess the economic feasibility. The findings from this research will underscore the strategic benefits of integrating SMR plant with DERs – particularly for critical infrastructure load such as data centers.

14 - SOLAR ENERGY↗

DOE OSTI2022

Towards Superior Software Portability with SHAD and HPX C++ Libraries

As hardware architectures and software stacks complexity grows, development productivity, performance and software portability, quickly evolve from desirable features to actual needs. SHAD, the Scalable High-performance Algorithms and Data-structures C++ library is designed to mitigate these issues: it provides general purpose building blocks as well as high-level custom utilities, and offers a shared-memory programming abstraction which facilitates the programming of complex systems, scaling up to High Performance Computing clusters. SHAD’s portability is achieved through an abstract runtime interface, which decouples the upper layers of the library and hides the low level details of the underlying architecture. This layer enables SHAD to interface with different runtime/threading systems, e.g. Intel TBB and Global Memory and Threading (GMT). However, current backends targeting distributed systems, rely on a centralized controller which may possibly limit scalability up to hundreds of nodes and creates a network hot spot due to all to one communication for synchronization, and possibly resulting in degraded performance at high process counts. In this research, we explore HPX, the C++ standard library for parallelism and concurrency, as an additional backend in support of the SHAD library, and present the methodologies in support of local and remote task executions in SHAD with respect to HPX. Finally, we evaluate the proposed system by comparing against existing backends of SHAD and analyzing their performance on C++ Standard Template Library algorithms.

Wu, Nanmiao↗

DOE OSTI2017

Experiments and Analyses of Data Transfers Over Wide-Area Dedicated Connections

Dedicated wide-area network connections are increasingly employed in high-performance computing and big data scenarios. One might expect the performance and dynamics of data transfers over such connections to be easy to analyze due to the lack of competing traffic. However, non-linear transport dynamics and end-system complexities (e.g., multi-core hosts and distributed filesystems) can in fact make analysis surprisingly challenging. We present extensive measurements of memory-to-memory and disk-to-disk file transfers over 10 Gbps physical and emulated connections with 0–366 ms round trip times (RTTs). For memory-to-memory transfers, profiles of both TCP and UDT throughput as a function of RTT show concave and convex regions; large buffer sizes and more parallel flows lead to wider concave regions, which are highly desirable. TCP and UDT both also display complex throughput dynamics, as indicated by their Poincare maps and Lyapunov exponents. For disk-to-disk transfers, we determine that high throughput can be achieved via a combination of parallel I/O threads, parallel network threads, and direct I/O mode. Our measurements also show that Lustre filesystems can be mounted over long-haul connections using LNet routers, although challenges remain in jointly optimizing file I/O and transport method parameters to achieve peak throughput.

Rao, Nageswara S.↗

DOE OSTI2025

Laser Powder Bed Fusion Manufactured Alloys 625 and 282 and Properties Relevant to Advanced Nuclear Components

Under the Advanced Materials and Manufacturing Technologies program, two Ni-based alloys fabricated by laser powder bed fusion (LPBF) have been evaluated: γ′-strengthened Haynes 282 and solution-strengthened Inconel 625. Large printing defects were observed in the LPBF 282 alloy fabricated using a Renishaw AM250 machine, likely due to particle spattering during printing. Annealing at 1,180°C for 1 h followed by 4 h at 800°C in a high density of 50 nm γ′-strengthening precipitates as well as partial recrystallization resulted in a bimodal grain distribution. Creep testing performed at 750°C revealed lower creep life and ductility for the LPBF 282 compared with wrought 282. X-ray computed tomography combined with optical and scanning electron microscopy microstructural characterization revealed crack formation during creep testing, initiated either from printing defects or from creep cavitation at grain boundaries. Printing defects were the likely reason for the lower creep performance of LPBF 282 and could be suppressed by optimizing the build configuration. Printing 625 on an EOS M290 machine using the recommended EOS parameters resulted in a very low defect density. Superior creep strength at 725°C was observed for the as-printed LPBF 625 along the build direction when compared with wrought 625. No defect larger than ~50 µm could be detected by X-ray computed tomography in the as-printed conditions and after creep testing for 1,000 h at 725°C and 150 MPa. Small, needle-like δ-phase precipitates were observed after creep testing for 100 h at 725°C and 200 MPa. The rapid formation of the γ phase is directly related to the initial Nb and Mo segregation in the LPBF 625 cell walls, and its effect on the alloy’s high-temperature performance will be evaluated. Solution annealing was carried out at 1,150°C for 1 h and led to full recrystallization of the alloy. A decrease in strength and increase in ductility were observed after solution annealing, and the alloy recrystallization resulted in isotropic tensile properties at room temperature, contrary to what was observed for the as-printed LPBF 625.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2013

Biological and Environmental Research Network Requirements

The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the U.S. Department of Energy (DOE) Office of Science (SC), the single largest supporter of basic research in the physical sciences in the United States. In support of SC programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet be a highly successful enabler of scientific discovery for over 25 years. In November 2012, ESnet and the Office of Biological and Environmental Research (BER) of the DOE SC organized a review to characterize the networking requirements of the programs funded by the BER program office. Several key findings resulted from the review. Among them: 1) The scale of data sets available to science collaborations continues to increase exponentially. This has broad impact, both on the network and on the computational and storage systems connected to the network. 2) Many science collaborations require assistance to cope with the systems and network engineering challenges inherent in managing the rapid growth in data scale. 3) Several science domains operate distributed facilities that rely on high-performance networking for success. Key examples illustrated in this report include the Earth System Grid Federation (ESGF) and the Systems Biology Knowledgebase (KBase). This report expands on these points, and addresses others as well. The report contains a findings section as well as the text of the case studies discussed at the review.

09 BIOMASS FUELS↗

DOE OSTI2024

Generative machine learning for detector response modeling with a conditional normalizing flow

In this paper, we explore the potential of generative machine learning models as an alternative to the computationally expensive Monte Carlo (MC) simulations commonly used by the Large Hadron Collider (LHC) experiments. Our objective is to develop a generative model capable of efficiently simulating detector responses for specific particle observables, focusing on the correlations between detector responses of different particles in the same event and accommodating asymmetric detector responses. Here, we present a conditional normalizing flow model ($\mathcal{CNF}$) based on a chain of Masked Autoregressive Flows, which effectively incorporates conditional variables and models high-dimensional density distributions. We assess the performance of the $\mathcal{CNF}$ model using a simulated sample of Higgs boson decaying to diphoton events at the LHC. We create reconstruction-level observables using a smearing technique. We show that conditional normalizing flows can accurately model complex detector responses and their correlation. This method can potentially reduce the computational burden associated with generating large numbers of simulated events while ensuring that the generated events meet the requirements for data analyses. We make our code available at https://github.com/allixu/normalizing_flow_for_detector_response

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2023

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Single-Bubble Flow Boiling Phenomena - Interface Tracking Simulation

Boiling, as one of the most efficient heat transfer mechanisms, is widely used in various engineering systems. Better understanding and modeling of this process remains a major challenge in multiphase flow research. The distribution of vapor in boiling system affects the heat transfer rate and may cause unfavorable conditions, such as heater burn-out. A number of flow regimes have been observed experimentally. In general, there are three regimes under boiling conditions: nucleate boiling, transition boiling, and film boiling. The nucleate boiling regime is categorized into partial boiling regime and fully developed nucleate boiling, according to behavior of bubble dynamics and heat transfer characteristics. In the first region, as the wall temperature increases, the fraction of the wall surface subject to nucleate boiling increases until bubble formation occupies the entire heated surface. Heat transfer in this region is a complex mixture of single-phase forced convection and nucleate boiling. As bubble density increases, bubbles turn to coalesce and form insulating vapor patches, which impedes liquid flow back to the surface. The heat transfer rate under this condition reduces dramatically. This point is called Critical Heat Flux (CHF), which leads to boiling crisis. The behavior of boiling crisis is dependent on local fluid conditions due to bubble growth and departure. Experiments are the ultimate tool for boiling model development and verification, but they still lack some capabilities needed for better understanding of the local mechanism of this phenomena. It's difficult to capture many important details at the pressure/temperature conditions of interest using experimental techniques, such as full three dimensional measurements of velocity and temperature distribution and estimates of heat flux partitioning during the boiling process. The interface tracking simulation (ITS) is one of the promising approaches to describe heat transfer of boiling phenomena and their underlying mechanisms. The advances of high performance computing (HPC) in recent years made it possible to apply DNS to a wide variety of adiabatic flows. Some work has been done to implement evaporation / condensation models as well. Lee and Nydahl performed a numerical simulation of bubble growth and departure assuming that the bubble has the shape of a truncated sphere and a micro-layer exists during bubble growth. A 2-D cylindrical bubbles simulation has been done by Son with a simplified model to predict the heat flux in a thin liquid micro-layer. A direct simulation of 2D film boiling is conducted by Juric and Tryggvason. The film boiling, below critical pressure with a modified Level Set Method, is studied by Son and Dhir. Ose and Kunugi have developed a boiling and condensation model on subcooled boiling phenomena. Fuchs performed numerical simulations of bubble growth and departure considering wall conduction effects. Fully transient heat and fluid flow is modeled with a free surface of a rising bubble and a periodic calculation of the whole cycling of a growing, detaching, and rising bubble. Mukherjee and Kandikar have done a numerical simulation of an evaporating meniscus on a moving heated surface with level set method. The heat transfer associated with the advancing and receding contact angle has been studied. To develop the capability of physics-based boiling process, in the presented work the energy and momentum equations are coupled to simulate single-bubble growth scenarios. For a single bubble simulation in infinite liquid, the analytical solution exists and can be compared with the numerical results for verification purposes. The presented capabilities will be utilized in the large scale DNS of boiling flows in the future. The finite-element based code, PHASTA is used for the simulation. It is a parallel, hierarchic, higher-order accurate, adaptive, stabilized, transient analysis flow solver, which has been shown to be an effective tool for a wide range of single and two-phase flow problems. It has been shown to be highly scalable on top supercomputers ({approx}85% scaling on up to 3 million mesh partitions using a 92 billion element mesh . PHASTA has been shown to reliably predict the details of adiabatic bubbly flows as well as single-phase flows with heat transfer. To develop the capability of physics-based boiling process, in the presented work the energy and momentum equations are coupled to simulate a single-bubble growth scenario. For a single bubble growth in superheated water, the analytical solution exists and can be compared with the numerical results for verification purposes. The second-order accurate spatial and time discretization is used for the flow solver in the presented work. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2017

Quantifying model structural error: Efficient Bayesian calibration of a regional groundwater flow model using surrogates and a data-driven error model

Groundwater model structural error is ubiquitous, due to simplification and/or misrepresentation of real aquifer systems. During model calibration, the basic hydrogeological parameters may be adjusted to compensate for structural error. This may result in biased predictions when such calibrated models are used to forecast aquifer responses to new forcing. Here, we investigate the impact of model structural error on calibration and prediction of a real-world groundwater flow model, using a Bayesian method with a data-driven error model to explicitly account for model structural error. The error-explicit Bayesian method jointly infers model parameters and structural error and thereby reduces parameter compensation. In this study, Bayesian inference is facilitated using high performance computing and fast surrogate models (based on machine learning techniques) as a substitute for the computationally expensive groundwater model. We demonstrate that with explicit treatment of model structural error, the Bayesian method yields parameter posterior distributions that are substantially different from those derived using classical Bayesian calibration that does not account for model structural error. We also found that the error-explicit Bayesian method gives signficantly more accurate prediction along with reasonable credible intervals. Finally, through variance decomposition, we provide a comprehensive assessment of prediction uncertainty contributed from parameter, model structure, and measurement uncertainty. The results suggest that the error-explicit Bayesian approach provides a solution to real-world modeling applications for which data support the presence of model structural error, yet model deficiency cannot be specifically identified or corrected.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Density scaling approximation for Monte-Carlo simulations of radioactive plumes

The release of radioactive gas into the atmosphere can diffuse into large volumes of air downwind from the point of release. The extent of radioactivity can cover thousands of cubic meters of air. For such large volumes, the weather models used to predict the down-wind distribution of the plume and the radiation transport models used to predict the radiation reaching ground-level from the plume can take tens of hours of computer time on multi-node institutional High-Performance Computing facilities. In this paper we focus on the radiation transport aspect of plume modeling. Here, we describe a phenomenological method for approximating the amounts of radiation that reach ground level from large volumes of a static radioactive plume that can be calculated on a stand-alone personal computer in much shorter computation times than those usually needed for such large volume evaluations. We refer to this method as the Density Scaling Approximation (DSA). Its ability to approximate ground-level count rates of large plumes comes from using a small-plume volume with a scaled-up value of air density to simulate the same number of scatterings that occur during transport in larger plume volumes at normal air density. We demonstrate the DSA by using a 100 m-diameter air-filled hemispherical dome geometry with a uniform volumetric activity of 135 Xe gas throughout the air-filled volume. The DSA for a larger dome diameter is obtained by evaluating the 100 m dome with an air density scaled up by the linear ratio of the larger diameter to the 100 m diameter. We find that this approximation works well for dome diameters up to 1200 m – the largest diameter studied and a size more than sufficient for accounting for all the radiation from 135 Xe. Moreover, most of our DSA results can be calculated over 500 times faster than corresponding full-sized geometry with normal air density. To help evaluate the accuracy of the DSA and gain insight into how well it can reproduce different regions of the spectra, we use three, easily understood regions of interest to compare the DSA results to the full-sized geometry at normal air density results. These regions are the full-energy peak, the region of single-Compton scattering, and the region of multiple-Compton scattering. We show how the dominance of the Compton scattering mechanism determines this division and thus provides insight into how Compton scattering is manifested in spectra from photon scattering through air in general, and how well the DSA approximation works.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2019

Spack-Based Packaging and Development for HEP

The art event-based analysis framework is used by multiple Intensity Frontier and other experiments and projects in High Energy Physics (HEP). A system of tools and scripts based around a Fermilab-originated package management system called UNIX Product Support (UPS) has evolved to provide development, packaging, release management, and distribution of the art suite, related experimental software and external dependencies in relocatable binary form. The existing system has limitations in environments such as macOS with System Integrity Protection (SIP) enabled and the various High Performance Computing (HPC) systems that the field of HEP is increasingly looking to leverage. This has led to a search for other ways of providing experiments with a packaging and build system that meets their needs. We describe our efforts to develop a packaging and release management system based on the Spack HPC package management tool to replace the existing UPS-based system. We additionally describe a companion system: SpackDev and cetmodules, allowing simultaneous development of multiple HEP software packages in a consistent environment. A successful implementation of the intended system would have applicability across HEP rather than merely to the users of the art framework.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2017

MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A≈WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets. The main contribution of this work is a new, high-performance parallel computational framework for a broad class of NMF algorithms that iteratively solves alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). The framework is flexible and able to leverage a variety of NMF and NLS algorithms, including Multiplicative Update, Hierarchical Alternating Least Squares, and Block Principal Pivoting. Our implementation allows us to benchmark and compare different algorithms on massive dense and sparse data matrices of size that spans from few hundreds of millions to billions. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements. The code and the datasets used for conducting the experiments are available online.

2D↗

DOE OSTI2021

Machine learning-based analysis of COVID-19 pandemic impact on US research networks

Here in this study we explore how fallout from the changing public health policy around COVID-19 has changed how researchers access and process their science experiments. Using a combination of techniques from statistical analysis and machine learning, we conduct a retrospective analysis of historical network data for a period around the stay-at-home orders that took place in March 2020. Our analysis takes data from the entire ESnet infrastructure to explore DOE high-performance computing (HPC) resources at OLCF, ALCF, and NERSC, as well as User sites such as PNNL and JLAB. We look at detecting and quantifying changes in site activity using a combination of t-Distributed Stochastic Neighbor Embedding (t-SNE) and decision tree analysis. Our findings bring insights into the working patterns and impact on data volume movements, particularly during late-night hours and weekends.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Modeling primary atomization of liquid fuels using a multiphase DNS/LES Approach

We report on the development of a model framework to simulate spray flames from direct injection of liquid fuel into an automotive cylinder engine. The approach to this challenging problem was twofold. On one hand, the interface-capturing multiphase computer code CLSVOF was used to resolve the rapidly evolving, topologically convoluted interfaces that separate the liquid fuel from the gas at injection: the main challenges to address were the treatment of the high-pressure flow inside the injector, which required the inclusion of compressibility effects; and the computational framework necessary to achieve a Direct Numerical Simulation (DNS) level of accuracy. On the other hand, the scales of turbulent fuel mixing and combustion in the cylinder engine were addressed by the high-performance computer code RAPTOR within the Large Eddy Simulation (LES) framework. To couple the two computational methods, a novel methodology was developed to de- scribe the dense spray dynamics in Raptor from the assigned spray size distribution and dispersion angle derived from CLSVOF. This new, independent Eulerian Multi-Fluid (EMF) spray module was developed based on the kinetic description of a system of droplets as a pressure-less gas; as we will show, it was demonstrated to efficiently render the near-nozzle coupling in mass, momentum, and energy with the carrier gas phase.

02 PETROLEUM↗