Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 937 records · Page 52

Final Report - Subcontract B629114

During my visits to LLNL August 20-24, 2018, and September 10-14, 2018, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from $hp$ adaptive finite element calculations, and is implemented in the PLTMG software package, version 13. This preconditioner typically requires 3 – 20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree $p$ as $p → ∞$, but but remains strong for $p ≤$ 9, which is the highest polynomial degree allowed in PLTMG , due to limitations of the numerical quadrature rules implemented in the software package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗

Artificial correlation heating in PIC simulations

The Particle-in-Cell (PIC) method, a cornerstone in plasma modeling, is widely employed for its ability to simulate kinetic phenomena in device-scale domains. Part of what makes this possible is that computational macroparticles represent many physical particles. It converges under certain constraints, including a grid spacing that resolves the Debye length and a time step small enough to respect the Courant–Friedrichs–Lewy condition and plasma frequency stability limit. Here, we introduce a new constraint necessary to avoid Artificial Correlation Heating (ACH). This requires that the macroparticle coupling strength be smaller than one, Γ ω < 1, where Γ ω ≡ Γω 2/3 ⁠, Γ = Z 2 e 2 /(4πε 0 ak B T) is the physical coupling strength, and w is the macroparticle weight. This is particularly relevant to 3D simulations of dense plasmas, which are becoming common with modern computing power. If this condition is violated, the finite macroparticle weight artificially enhances the coupling strength and causes the plasma to heat until the macroparticle coupling strength is near unity, depending on the grid resolution. A comprehensive model of ACH is developed that incorporates electron density, temperature, macroparticle weight, and grid resolution. It is then tested using PIC simulations, delineating the boundaries of the method's applicability and offering a predictive framework for ACH. Moreover, the research explores a runaway heating process induced by ACH in the presence of ionization, which can lead to numerical instability. A conclusion of this study is that the onset of ACH can impose a more stringent constraint on the macroparticle weight and average number of macroparticles per cell than what is typically expected, particularly in 3D simulations of dense plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Connecting Restricted, High-Availability, or Low-Latency Resources to a Seamless Global Pool for CMS

The connection of diverse and sometimes non-Grid enabled resource types to the CMS Global Pool, which is based on HTCondor and glideinWMS, has been a major goal of CMS. These resources range in type from a high-availability, low latency facility at CERN for urgent calibration studies, called the CAF, to a local user facility at the Fermilab LPC, allocation-based computing resources at NERSC and SDSC, opportunistic resources provided through the Open Science Grid, commercial clouds, and others, as well as access to opportunistic cycles on the CMS High Level Trigger farm. In addition, we have provided the capability to give priority to local users of beyond WLCG pledged resources at CMS sites. Many of the solutions employed to bring these diverse resource types into the Global Pool have common elements, while some are very specific to a particular project. This paper details some of the strategies and solutions used to access these resources through the Global Pool in a seamless manner.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗

Parallel adaptive wavelet collocation method for PDEs

A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 2048{sup 3} using as many as 2048 CPU cores.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resilience of the Electric Grid Through Trustable IoT-Coordinated Assets

The electricity grid has evolved from a physical system to a cyberphysical system with digital devices that perform measurement, control, communication, computation, and actuation. The increased penetration of distributed energy resources (DERs) including renewable generation, flexible loads, and storage provides extraordinary opportunities for improvements in efficiency and sustainability. However, they can introduce new vulnerabilities in the form of cyberattacks, which can cause significant challenges in ensuring grid resilience. We propose a framework in this paper for achieving grid resilience through suitably coordinated assets including a network of Internet of Things devices. A local electricity market is proposed to identify trustable assets and carry out this coordination. Situational Awareness (SA) of locally available DERs with the ability to inject power or reduce consumption is enabled by the market, together with a monitoring procedure for their trustability and commitment. With this SA, we show that a variety of cyberattacks can be mitigated using local trustable resources without stressing the bulk grid. Multiple demonstrations are carried out using a high-fidelity cosimulation platform, real-time hardware-in-the-loop validation, and a utility-friendly simulator.

distributed energy resources↗

EUREICA: Efficient UltRa Endpoint IoT-enabled Coordinated Architecture

The electricity grid has evolved from a physical system to a cyber-physical system with digital devices that perform measurement, control, communication, computation, and actuation. The increased penetration of distributed energy resources (DERs) that include renewable generation, flexible loads, and storage provides extraordinary opportunities for improvements in efficiency and sustainability. However, they can introduce new vulnerabilities in the form of cyberattacks, which can cause significant challenges in ensuring grid resilience. The purpose of this project was to develop a framework ((Efficient, Ultra-REsilient, IoT-Coordinated Assets, or EUREICA)for achieving grid resilience through suitably coordinated assets including a network of Internet of Things (IoT) devices, and a local electricity market (LEM) to identify trustable assets and carry out this coordination. Situational Awareness (SA) of locally available DERs with the ability to inject power or reduce consumption is enabled by the market, together with a monitoring procedure for their trustability and commitment. Experiments conducted during this project demonstrated that, with this SA, a variety of cyberattacks can be mitigated using local trustable resources without stressing the bulk grid. The demonstrations were carried out using a variety of high-fidelity co-simulation platforms, real-time hardware-in-the-loop validation, and a utility-friendly simulator.

14 SOLAR ENERGY↗

A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS

Existing approaches for allocating resources on edge environments are inefficient and lack the support of heterogeneous edge devices, which in turn fail to optimize the dependency on cloud infrastructures or datacenters. To this extent, we propose in this paper OpERA, a multi-layered edge-based resource allocation optimization framework that supports heterogeneous and seamless execution of offloadable tasks across edge, fog, and cloud computing layers and architectures. By capturing offloadable task requirements, OpERA is capable of identifying suitable resources within nearby edge or fog layers, thus optimizing the execution process. Throughout the paper, we present results which show the effectiveness of our proposed optimization strategy in terms of reducing costs, minimizing energy consumption, and promoting other residual gains in terms of processing computations, network bandwidth, and task execution time. We also demonstrate that by optimizing resource allocation in computation offloading, it is then possible to increase the likelihood of successful task offloading, particularly for computationally intensive tasks that are becoming integral as part of many IoT applications such robotic surgery, autonomous driving, smart city monitoring device grids, and deep learning tasks. The evaluation of our OpERA optimization algorithm reveals that the TOPSIS MCDM technique effectively identifies optimal compute resources for processing offloadable tasks, with a 96% success rate. Moreover, the results from our experiments with a diverse range of use cases show that our OpERA optimization strategy can effectively reduce energy consumption by up to 88%, and operational costs by 76%, by identifying relevant compute resources.

97 MATHEMATICS AND COMPUTING↗

Distribution Integration Solution Cost Options (DISCO) [Slides]

DISCO is a Python-based NREL software tool for conducting scalable, repeatable distribution analyses. Although DISCO was originally developed to support photovoltaic impact analyses, it can also be used to understand the impact of other distributed energy resources and load changes on distribution systems. This presentation took place on April 9, 2024, and included NREL power grid researchers Sherin Ann Abraham and Shibani Ghosh.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

5G Energy FRAME Report on 5G for Grid Use Case (Year 3 Final Report)

This report provides an extensive overview of the interrelationships among energy, communication, and computing—especially in the context of decarbonization goals, challenges, and opportunities. Technical examples enabled by 5G technologies and their performance are presented, discussed, based on the experiment performed at Pacific Northwest National Laboratory. This is the first use case focused on using 5G for the U.S. power grid and will be referred to as the 5G for Grid Use Case from here on. Specifically, this use case looks at the workflow, which integrates the performance data of a real-world 5G communication testbed and a grid transmission and distribution co-simulation platform. The cross-domain information flow and logic design are illustrated with a combination of power grid contingencies and events. Lastly, a summary of the project achievement and outcome is provided, along with a technology roadmap envisioned by the project team.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Diagonal and circulant or skew-circulant splitting preconditioners for spatial fractional diffusion equations

We propose three new preconditioners: diagonal and optimal-circulant splitting preconditioner, diagonal and skew-circulant splitting preconditioner, and diagonal and optimal-skew-circulant splitting preconditioner for solving the diagonal-plus-Toeplitz linear system discretized from the spatial fractional diffusion equations. Theoretical analysis shows that these three preconditioners can make the eigenvalues of the preconditioned matrices be clustered around 1, especially when the grids of the discretizations are refined. These results coincide with the one about the diagonal and circulant splitting preconditioner constructed recently by Bai et al. (Numer Linear Algebra Appl 24:e2093, 2017). Numerical experiments exhibit that the proposed preconditioners can significantly improve the convergence of the Krylov subspace iteration methods like GMRES and BiCGSTAB, and they outperform the diagonal and circulant splitting preconditioner as well.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Model-Free Transactional Control of Building Loads to Support Grid Services

A transition from generation on demand to consumption on demand is one of the solutions to overcome the many limitations associated with the higher penetration of renewable energy sources. Such a transition, however, requires a considerable amount of load flexibility in the demand side. Demand response (DR) programs can reveal and utilize this demand flexibility by enabling the participation of a large number of grid-interactive efficient buildings (GEB). Existing approaches on DR require significant modelling or training efforts, are computationally expensive, and do not guarantee the satisfaction of end users. To address the aforementioned limitations, this software code considers a scalable hierarchical model-free transactional control approach that incorporates elements of virtual battery, game theory, and model-free control (MFC) mechanisms. The developed approach separates the control mechanism into upper and lower levels. The MFC modulates the flexible GEB in the lower level with guaranteed thermal comfort of end users in response to the optimal pricing and power signals determined in the upper layer using a Stackelberg game integrated with aggregate virtual battery constraints. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable even on small, embedded devices. This software code enables the use of residential and small-size commercial buildings to offer a potentially substantial source of ancillary grid services that are currently underutilized. A hierarchical, model-free transactive building control provides a smooth interface between the grid service requests of utilities and the reliable control required by participating buildings. Model-free control, which supports distributed control architecture, will be a more scalable solution that can be deployed in neighborhood-size systems as well as individual buildings. The proposed approach contributes to the body of knowledge on two main aspects. First, it couples the MFC with the game-theoretic control and proposes a scalable model-free transactive control approach. MFC does not require any modeling effort or model training for the various building loads. This is very beneficial since deriving an accurate model for every single unit participating in DR programs and obtaining all the parameters about the units (e.g., thermal coefficients, standby losses) are infeasible. Also, MFC is computationally efficient, easily deployable even on small, embedded devices, and can be implemented in real time. Second, it integrates the concept of virtual battery into DR via the Stackelberg game. The concept of virtual battery enables efficient coordination and aggregation of a large number of flexible GEB with guaranteed thermal comfort of end users.

Olama, Mohammed [Oak Ridge National Lab. (ORNL), O↗

Generative AI for Power Grid Operations

Generative artificial intelligence (AI) has captured into the mainstream, demonstrating capabilities that once belonged solely to the realm of human cognition. From defeating world champions in complex games to generating human-quality text and images, Generative AI has proven its potential to revolutionize countless industries. The electric power grid is no exception. Generative AI's ability to process vast amounts of data rapidly, assist decision support and identify patterns could significantly enhance power grid operations. For example, Generative AI could improve state estimation where measurements are not available or integrate renewable energy sources more efficiently with probabilistic forecasting. The key contributions of this whitepaper are outlined below: (1) Comprehensive overview of Generative AI's applications in power grid operations: It highlights the opportunities in areas such as forecasting, state estimation, and demonstrating the potential for enhancing efficiency, reliability, and resilience. (2) Expanding Generative AI's impact through synergies with emerging technologies: The paper introduce NREL developed eGridGPT and explores how AI orchestration, multi-agent systems, and Digital Twins can collaborate to optimize grid operations, addressing the complexities of a decarbonized and electrified future. (3) In-depth analysis of challenges in implementing Generative AI: This includes considerations like data availability and quality, model validation, certification, and ethical concerns, ensuring responsible AI deployment. (4) Emphasizing human-AI collaboration: The whitepaper underscores the importance of trustworthy, transparency, and explainability in AI systems to promote seamless interaction between human operators and AI, ultimately improving decision-making. (5) Exploring future research and development: It identifies critical areas for further advancement to fully realize Generative AI's potential in power grid operations. This whitepaper serves as a valuable resource for researchers, practitioners, and policymakers looking to harness Generative AI for a more reliable, stable, and cost-effective power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantifying cell migration distance as a contributing factor to the development of rectal toxicity after prostate radiotherapy

Purpose: Spatial information is usually neglected in mathematical models of radiation-induced toxicity. In the presence of inhomogeneous dose distributions produced by intensity modulated radiation therapy (IMRT) and volumetric arc therapy, this may be a limitation. We present a model to quantify the spatial characteristics of the dose distribution on the rectum through the quantification of the distribution of distances between dose points on the surface of the rectum in three-dimensions. The method allows us to evaluate the hypothesis that distances between lower and higher dose regions on the rectum influence radiation damage repair due to the migration of normal cells into damaged areas, and consequently, the development of radiation-induced toxicity in patients treated with radiation for prostate cancer. Methods: We present a method to compute distances between dose points on the surface of the rectum in three dimensions (3D) and to generate distance maps representing the distances between specific dose regions on the rectum. We introduce the concept of the distance dose surface histogram (DDSH), which is computed from the distance maps. The DDSH is a 2D histogram of rectum area on a grid defined by pairwise combinations of dose and distance. Each bin in the DDSH quantifies the area of the rectum exposed to a given dose and at a given distance from other another dose region on the rectum. By summing across the columns and rows of the DDSH, we can generate the dose surface histogram (DSH) and distance surface histogram (DiSH) for a particular dose region. The DiSH is a marginal histogram showing the distribution of distances for the dose points in a specific dose region from another region. We computed the DDSH, DiSH, and DSH for 33 patients treated with IMRT for prostate cancer, nine of whom developed late Grade 2 or higher late rectal toxicity. Results: We show how even though the total area of the rectum exposed to a given dose may be the same for different patients, the distribution of distances for points receiving that dose can be different depending on the shape and contiguity of the region(s) containing those dose points. We also show that area of the rectum in the region receiving more than 75 Gy and at a distance of 16 to 22 mm from the 50 Gy isodose line was significantly correlated to the development of toxicity (p = 0.004, two sided t-test). This suggests that examining the distance distribution of points in specific dose regions could provide valuable additional information in predicting the risk of a patient developing radiation-induced rectal toxicity. Conclusions: We present a new method to quantify the spatial distribution of points in a given region relative to other regions on the rectum. The method provides a means to evaluate the hypothesis that distances between lower and higher dose regions on the rectum influence radiation damage repair due to the migration of normal cells into damaged areas, and may be a contributing factor to the development of radiation-induced toxicity in patients treated with radiation for prostate cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Final Report for ALCC Allocation: Predictive Simulation of Complex Flow in Wind Farms

This report documents work performed using ALCC computing resources granted under a proposal submitted in February 2016, with the resource allocation period spanning the period July 2016 through June 2017. The award allocation was 10.7 million processor-hours at the National Energy Research Scientific Computing Center. The simulations performed were in support of two projects: the Atmosphere to Electrons (A2e) project, supported by the DOE EERE office; and the Exascale Computing Project (ECP), supported by the DOE Office of Science. The project team for both efforts consists of staff scientists and postdocs from Sandia National Laboratories and the National Renewable Energy Laboratory. At the heart of these projects is the open-source computational-fluid-dynamics (CFD) code, Nalu. Nalu solves the low-Mach-number Navier-Stokes equations using an unstructured- grid discretization. Nalu leverages the open-source Trilinos solver library and the Sierra Toolkit (STK) for parallelization and I/O. This report documents baseline computational performance of the Nalu code on problems of direct relevance to the wind plant physics application - namely, Large Eddy Simulation (LES) of an atmospheric boundary layer (ABL) flow and wall-modeled LES of a flow past a static wind turbine rotor blade. Parallel performance of Nalu and its constituent solver routines residing in the Trilinos library has been assessed previously under various campaigns. However, both Nalu and Trilinos have been, and remain, in active development and resources have not been available previously to rigorously track code performance over time. With the initiation of the ECP, it is important to establish and document baseline code performance on the problems of interest. This will allow the project team to identify and target any deficiencies in performance, as well as highlight any performance bottlenecks as we exercise the code on a greater variety of platforms and at larger scales. The current study is rather modest in scale, examining performance on problem sizes of O(100 million) elements and core counts up to 8k cores. This will be expanded as more computational resources become available to the projects.

17 WIND ENERGY↗

Hybrid-view programming of nuclear fusion simulation code in the PGAS parallel programming language XcalableMP

Recently, the Partitioned Global Address Space (PGAS) parallel programming model has emerged as a usable distributed memory programming model. XcalableMP (XMP) is a PGAS parallel programming language that extends base languages such as C and Fortran with directives in OpenMP-like style. XMP supports a global-view model that allows programmers to define global data and to map them to a set of processors, which execute the distributed global data as a single thread. In XMP, the concept of a coarray is also employed for local-view programming. In this study, we port Gyrokinetic Toroidal Code - Princeton (GTC-P), which is a three-dimensional gyrokinetic PIC code developed at Princeton University to study the microturbulence phenomenon in magnetically confined fusion plasmas, to XMP as an example of hybrid memory model coding with the global-view and local-view programming models. In local-view programming, the coarray notation is simple and intuitive compared with Message Passing Interface (MPI) programming while the performance is comparable to that of the MPI version. Thus, because the global-view programming model is suitable for expressing the data parallelism for a field of grid space data, we implement a hybrid-view version using a global-view programming model to compute the field and a local-view programming model to compute the movement of particles. Finally, the performance is degraded by 20% compared with the original MPI version, but the hybrid-view version facilitates more natural data expression for static grid space data (in the global-view model) and dynamic particle data (in the local-view model), and it also increases the readability of the code for higher productivity.

97 MATHEMATICS AND COMPUTING↗

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗