Search NASA⌕ Search

SEARCH · Search NASA

Results for “Grid 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

General relativistic simulations of collapsing binary neutron star mergers with Monte Carlo neutrino transport

Recent gravitational wave observations of neutron-star-neutron-star and neutron-star-black-hole binaries appear to indicate that massive neutron stars may not be too uncommon in merging systems. These discoveries have led to an increased interest in the simulation of merging compact binaries involving massive stars. In this paper, we present a first set of evolution of massive neutron star binaries using Monte Carlo radiation transport for the evolution of neutrinos. Here, we study a range of systems, from nearly symmetric binaries that collapse to a black hole before forming a disk or ejecting material, to more asymmetric binaries in which tidal disruption of the lower mass star leads to the production of more interesting postmerger remnants. For the latter type of systems, we additionally study the impact of viscosity on the properties of the outflows, and compare our results to two recent simulations of identical binaries performed with the whiskyTHC code. We find agreement on the black hole properties, disk mass, and mass and velocity of the outflows within expected numerical uncertainties, and some minor but noticeable differences in the evolution of the electron fraction when using a subgrid viscosity model, with viscosity playing a more minor role in our simulations. The method used to account for r-process heating in the determination of the outflow properties appears to have a larger impact on our result than those differences between numerical codes. We also use the simulation with the most ejected material to verify that our newly implemented Lagrangian tracers provide a reasonable sampling of the matter outflows as they leave the computational grid. We note that, given the lack of production of hot outflows in these mergers, the main role of neutrinos in these systems is to set the composition of the postmerger remnant. One of the main potential uses of our simulations is, thus, as improved initial conditions for longer evolutions of such remnants.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantifying the effects of varietal types × management on the spatial variability of sorghum biomass across US environments

Abstract Regional‐scale estimations of sorghum biomass production allow identification of optimum genotype×environment×management (G×E×M) combinations for bioenergy generation. The objective of this study was to determine the degree of contributions of G, E, and M toward variability in sorghum biomass in the United States. Using the Agricultural Production Systems sIMulator in a grid computing platform, biomass was simulated for irrigated and rainfed conditions for 30 years across the United States for four sorghum varietal types (grain—GS, sudangrass—SS, photosensitive—PS, and photo‐insensitive—PI). Simulated biomass was assessed by environments clustered using the sum of intercepted solar radiation ( ir ), mean of temperature stress factor ( tp ) and water stress factor ( sw ). Simulated biomass ranged from 5.8 t ha −1 (GS‐rainfed) to 27.5 t ha −1 (PI‐irrigated). Under high‐temperature environments (mean annual temperature = 25°C), rainfed biomass between 40 and 80 days after planting (DAP) was strongly correlated with sw ( r = 0.64–0.86) and irrigated biomass with ir ( r = 0.68–0.81). Under low‐temperature environments (mean annual temperature = 18°C) after 40 DAP, tp and ir had greater effects than sw ( r = 0.55–0.82). Biomass variance was mainly explained by varietal type (50%–76%) in all environments×irrigation combinations, except in the high‐ and mid‐temperature environments under rainfed conditions where rainfall had the major effect (25%–45%). However, when mean temperature during the growing season decreased from 25°C (high environments) to 18°C (low environments), the contribution of mean temperature to biomass variance increased from 7% to 34% (rainfed) and from 4% to 36% (irrigated). Varietal type had the larger interactions with other factors independently of the environment and irrigation. We demonstrated a need to quantify (i) the main G×E×M drivers of biomass variability based on environmental stress factors and (ii) the variance contribution of these drivers on sorghum biomass. Our regional‐scale estimations are key inputs for future robust biomass projections of energy sorghum genotypes integrating G×E×M under climate change scenarios.

Ojeda, Jonathan J.↗

Calibrating constitutive models with full‐field data via physics informed neural networks

Abstract The calibration of solid constitutive models with full‐field experimental data is a long‐standing challenge, especially in materials that undergo large deformations. In this paper, we propose a physics‐informed deep‐learning framework for the discovery of hyperelastic constitutive model parameterizations given full‐field surface displacement data and global force‐displacement data. Contrary to the majority of recent literature in this field, we work with the weak form of the governing equations rather than the strong form to impose physical constraints upon the neural network predictions. The approach presented in this paper is computationally efficient, suitable for irregular geometric domains, and readily ingests displacement data without the need for interpolation onto a computational grid. A selection of canonical hyperelastic material models suitable for different material classes is considered including the Neo–Hookean, Gent, and Blatz–Ko constitutive models as exemplars for general non‐linear elastic behaviour, elastomer behaviour with finite strain lock‐up, and compressible foam behaviour, respectively. We demonstrate that physics informed machine learning is an enabling technology and may shift the paradigm of how full‐field experimental data are utilized to calibrate constitutive models under finite deformations.

Hamel, Craig M.↗

Generic Discretization Library

The GenDiL library is a collection of C++ software abstractions designed to discretize and solve partial differential equations (PDEs) for high-performance computing (HPC) applications. Its primary focus is on modern C++ generic programming, which helps ensure portability across various hardware architectures. The central idea behind the library is to provide building blocks for numerical algorithms-such as discretization methods and iteration patterns-so that domain experts can focus on the math, rather than the low-level details of hardware or implementation. By defining abstractions for data types, iteration over computational grids, and scheduling of operations, the library isolates the high-level PDE algorithms from the platform-specific optimizations needed to achieve efficient performance.

Dudouit, Yohann [Lawrence Livermore National Labor↗

ASCR@40

One page flyers on: A Revolution in Modeling and Simulation; Applying Equations to Complex Problems; Uncertainty Quantification; Moving Big Data; Grid Computing for High-Speed Collaboration; Making Sense of Big Data; Overcoming Scaling Challenges; Building Better Computers; World-Leading Computing Facilities; Supporting Science Through Open-Source Software; and Building the Computational Workforce. Content provided by Department of Energy multiprogram laboratory researchers. Prepared by the Krell Institute for the ASCAC Subcommittee on the 40-year History of ASCR.

97 MATHEMATICS AND COMPUTING↗

Operational Evolution of FTS3: A DevOps Driven Approach to Elastic Operations

The File Transfer Service (FTS3) is a distributed data movement service developed at CERN and widely used to transfer data across the Worldwide LHC Computing Grid (WLCG). At Fermilab, FTS3 supports data transfers for multiple experiments, including Intensity Frontier experiments such as DUNE, enabling reliable data movement between WebDAV endpoints in Europe and the Americas.​ At CHEP 2021, we reported on the initial containerized deployment of FTS3 on OKD, the community Kubernetes distribution of Red Hat OpenShift. In this work, we present the subsequent evolution of this deployment, focusing on new operational capabilities introduced to improve scalability, robustness, and long-term maintainability.​ We describe the adoption of more secure and reproducible container build workflows, the integration of DevOps-driven operational practices, and enhancements in monitoring and automation. A key new result is the introduction of horizontal scaling and elastic resource management, allowing FTS3 components to dynamically adapt to workload variations while maintaining service reliability. We also discuss improvements in fault tolerance and operational procedures derived from production experience.​ Finally, we summarize lessons learned from operating FTS3 as a Kubernetes-native service and outline how these developments have improved the resilience and efficiency of data movement operations at Fermilab.

Munoz Flores, Victor Leopoldo [Fermilab]↗

High y + Shear-Stress Turbulence Implementation for High Flux Isotope Reactor Narrow Channel Flows

The research objective of this work was to improve the engineering predictions of the turbulence characteristics of flows in curved narrow channels. Such channel flows are commonly encountered in nuclear research and test reactors, with one of them being the high-flux isotope reactor (HFIR). Research reactors bear high heat fluxes, and the proper computing of turbulence is paramount for safe and reliable reactor operation. The study builds on the results of a previous direct numerical simulation of turbulence to inform a well-known Reynolds-averaged Navier–Stokes shear-stress turbulence model and improves its accuracy in simulating parallel channel flows. A new formulation of the loss term in the dissipation conservation equation is suggested. Combined with high wall distance computational grids, the new implementation provides a fast-running flow solution, suitable for engineering purposes. Model generalization for parallel channel flows, in a broader range of frictional Reynolds numbers, is suggested by introducing a new form of the model constants.

CFD↗

FTS3: Data Movement Service in containers deployed in OKD

The File Transfer Service (FTS3) is a data movement service developed at CERN which is used to distribute the majority of the Large Hadron Collider's data across the Worldwide LHC Computing Grid (WLCG) infrastructure. At Fermilab, we have deployed FTS3 instances for Intensity Frontier experiments (e.g. DUNE) to transfer data in America and Europe, using a container-based strategy. In this article we summarize our experience building docker images based on work from the SLATE project (slateci.io) and deployed in OKD, the community distribution of Red Hat OpenShift. Additionally, we discuss our method of certificate management and maintenance utilizing Kubernetes CronJobs. Finally, we also report on the two different configurations currently running at Fermilab, comparing and contrasting a Docker-based OKD deployment against a traditional RPM-based deployment.

Lobato Pardavila, Lorena↗

Overcoming obstacles to IPv6 on WLCG

The transition of the Worldwide Large Hadron Collider Computing Grid (WLCG) storage services to dual-stack IPv6/IPv4 is almost complete; all Tier-1 and 94% of Tier-2 storage are IPv6 enabled. While most data transfers now use IPv6, a significant number of IPv4 transfers still occur even when both endpoints support IPv6. This paper presents the ongoing efforts of the HEPiX IPv6 working group to steer WLCG toward IPv6-only services by investigating and fixing the obstacles to the use of IPv6 and identifying cases where IPv4 is used when IPv6 is available. Removing IPv4 use is essential for the long-term agreed goal of IPv6-only access to resources within WLCG, thus eliminating the complexity and security concerns associated with dual-stack services. We present our achievements and ongoing challenges as we navigate the final stages of the transition from IPv4 to IPv6 within WLCG.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CMS Token Transition

Within the LHC community, a momentous transition has been occurring in authorization. For nearly 20 years, services within the Worldwide LHC Computing Grid (WLCG) have authorized based on mapping an identity, derived from an X.509 credential, or a group/role, derived from a VOMS extension issued by the experiment. A fundamental shift is occurring to capabilities: the credential, a bearer token, asserts the authorizations of the bearer, not the identity. By the HL-LHC era, the CMS experiment plans for the transition to tokens, based on the WLCG Common JSON Web Token profile, to be complete. Services in the technology architecture include the INDIGO Identity and Access Management server to issue tokens; a HashiCorp Vault server to store and refresh access tokens for users and jobs; a managed token bastion server to push credentials to the HTCondor CredMon service; and HTCondor to maintain valid tokens in long-running batch jobs. We will describe the transition plans of the experiment, current status, configuration of the central authorization server, lessons learned in commissioning token-based access with sites, and operational experience using tokens for both job submissions and file transfers.

43 PARTICLE ACCELERATORS↗

Separating Physics and Dynamics Grids for Improved Computational Efficiency in Spectral Element Earth System Models

Previous studies have shown that atmospheric models with a spectral element grid can benefit from putting physics calculations on a relatively coarse finite volume grid. Here we demonstrate an alternative high-order, element-based mapping approach used to implement a quasi-equal-area, finite volume physics grid in E3SM. Unlike similar methods, the new method in E3SM requires topology data purely local to each spectral element, which trivially allows for regional mesh refinement. Simulations with physics grids defined by 2 × 2, 3 × 3, and 4 × 4 divisions of each element are shown to verify that the alternative physics grid does not qualitatively alter the model solution. The model performance is substantially affected by the reduction of physics columns when using the 2 × 2 grid, which can increase the throughput of physics calculations by roughly 60%–120% depending on whether the computational resources are configured to maximize throughput or efficiency. A pair of regionally refined cases are also shown to highlight the refinement capability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emerging Computing Architectures: Simulation of Power Electronics in Power Grids

As the penetration of power electronics increases in power grids, new computing architectures needed to be evaluated for the simulation of high-fidelity models of power electronics in power grids in operations. In this paper, emerging computing architectures such as quantum processing units are evaluated for the simulation of power electronics in power grids. A hybrid algorithm based on classical computing and quantum computing is developed and tested for different use cases of electromagnetic transient (EMT) simulation of power electronics (PE)-based systems and simple circuits. The algorithms needed to simulate power electronics in emerging computing architectures are discussed and thereafter, simulation results are shown.

Debnath, Suman↗

Benchmarking the PCMCI Causal Discovery Algorithm for Spatiotemporal Systems

Causal discovery algorithms construct hypothesized causal graphs that depict causal dependencies among variables in observational data. While powerful, the accuracy of these algorithms is highly sensitive to the underlying dynamics of the system in ways that have not been fully characterized in the literature. In this report, we benchmark the PCMCI causal discovery algorithm in its application to gridded spatiotemporal systems. Effectively computing grid-level causal graphs on large grids will enable analysis of the causal impacts of transient and mobile spatial phenomena in large systems, such as the Earth’s climate. We evaluate the performance of PCMCI with a set of structural causal models, using simulated spatial vector autoregressive processes in one- and two-dimensions. We develop computational and analytical tools for characterizing these processes and their associated causal graphs. Our findings suggest that direct application of PCMCI is not suitable for the analysis of dynamical spatiotemporal gridded systems, such as climatological data, without significant preprocessing and downscaling of the data. PCMCI requires unrealistic sample sizes to achieve acceptable performance on even modestly sized problems and suffers from a notable curse of dimensionality. This work suggests that, even under generous structural assumptions, significant additional algorithmic improvements are needed before causal discovery algorithms can be reliably applied to grid-level outputs of earth system models.

54 ENVIRONMENTAL SCIENCES↗

Verifying the Computational Integrity of Power Grid Controls with Zero-Knowledge Proof

The control of future power grids is migrating from a centralized to a distributed/decentralized scheme to enable a massive penetration of distributed energy resources with rising dependence on communication infrastructure. A common assumption made for most existing distributed/decentralized controllers is that local controllers would faithfully follow the designated controller dynamics based on the data received from communication channels. However, with increased probability of cyberattacks on Operational Technology infrastructure, such an assumption could be risky because proper execution of the controller dynamics is then built on trust in secure communication and computation. In this work, we leverage a cryptography technology known as zero-knowledge scalable transparent arguments of knowledge (zk-STARK) to verify the computational integrity of power grid control algorithms, with projected linear dynamics-based control schemes as the initial proof-of-concept test case. The method presented here converts the cybersecurity challenge of data integrity for grid control into a subset of computational integrity.

computational integrity↗

Reassessing the Market—Computation Interface to Enhance Grid Security and Efficiency

The goal of this project is to reconsider core market and reliability processes that can potentially yield to transformative advances in power grid security, reliability, and efficiency. Current electric power market designs are strongly a function of computing capabilities and limitations that were available in the mid-to-late 1990s, circa deregulation. This includes constructs such as: (1) a 2-tiered day-ahead/real-time market construct; and (2) linearized (“DC”) real power flow approximations in dispatch and pricing. At that time, state-of-the-art computational capabilities could at the limit address deterministic mixed-integer programming formulations of unit commitment (UC) and linear programming formulations of economic dispatch (ED) at limited fidelity and scale. Such constraints forced limited look-ahead time-horizons, crude approximations of AC power flow physics and operations, and artificial partitioning between day-ahead markets, hour(s)-ahead reliability processes, and real-time markets. Consequently, these limitations have resulted in limited security and reliability with increasing out-of-market payments, particularly as uncertainty associated with renewables and distributed energy resources grows.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Wildfire Smoke PM2.5 per Zipcode

This dataset contains daily aggregated measurements of daily PM2.5 from ambient wildfire smoke in the contiguous United States, spanning from 2006 to 2016. The data is sourced from a study by Childs et al. (2022), titled "Daily Local-Level Estimates of Ambient Wildfire Smoke PM2.5 for the Contiguous US" published in Environmental Science & Technology. To compute the standardized weight across different zip codes, we computed the weight calculation on a 10km grids. To compute the weight, we obtain area-weights that add up to 1 in each polygon of zipcodes. This enabled us to calculate the smoke values per zipcode for the aforementioned period. Those interested in replicating our data processing pipeline can access it at https://github.com/NSAPH-Data-Processing/smoke_aggregation.

PM2.5↗

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗