SEARCH · Engineering Papers
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.
The Solar Uncertainty Integrator (SUNI) study was developed by the National Laboratory of the Rockies (NLR's) to provide a standardized "bulk uncertainty processing" method for solar irradiance data, which are essential for the successful deployment of solar energy systems. This poster provides an overview of key findings from NLR's SUNI application across 89 stations.
This presentation provides an over of uncertainty in solar measurements from the National Laboratory of the Rockies' Solar Uncertainty Integrator (SUNI).
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.
Environmental and sustainability concerns have caused a recent surge in the penetration of distributed energy resources into the power grid. This may lead to voltage violations in the distribution systems making voltage regulation more relevant than ever. Owing to this and rapid advancements in sensing, communication, and computation technologies, the literature on voltage control techniques is growing at a rapid pace in distribution networks. In particular, there is a paradigm shift from traditional offline centralized approaches to distributed ones leveraging increased and varied types of actuators, real-time sensing, fast and efficient computations, and an overall distributed situational awareness. This paper reviews state-of-the-art voltage control algorithms, summarizes the underlying methods, and classifies their coordination mechanisms into local, centralized, distributed, and decentralized. The underlying solution methodologies are further classified into two categories, open-loop and feedback-based. Two specific example workflows are provided to illustrate these solutions for voltage regulation.
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.
Distributed Resources for the Earth System Grid Federation (ESGF) Advanced Management (DREAM) is a proposed system that will enable data from an infinite number of diverse sources to be organized and accessed from anywhere using any handheld or other computer device. The approach offers a powerful roadmap for the creation and integration of a unified knowledge base of an entire ecosystem, including its many geophysical, geographical, social, political, agricultural, energy, transportation, and cyber aspects. The resulting aggregation of data has the potential to generate an informational universe of unprecedented size that has never before been possible due to the prohibitive costs, managerial complexity, and technical barriers associated with ever-changing exponential-growth data flows. We envision that DREAM will accelerate discovery by enabling climate researchers, among other types of researchers, to manage, analyze, and visualize data from earth-scale measurements and simulations. DREAM’s success will be built on proven components that leverage existing services and resources. A key building block for DREAM will be the ESGF, chaired by Dean N. Williams. Expanding on the existing ESGF, the project will ensure that the access, storage, movement, and analysis of the large quantities of data that are processed and produced by diverse science projects can be dynamically distributed with proper resource management. Much of the Office of Science data is currently generated by multiple stand-alone facilities. DREAM can collect data accumulated from these facilities and incorporate it into a fully integrated network accessible from anywhere in the world. The result is a completely new paradigm shift for data management, analysis, and visualization enabling researchers to: Manage their calculations, data, tools, and research results; Ensure that all data are sharable, reproducible and (re)usable—accompanied by appropriate metadata describing its provenance, syntax, and semantics at creation; Advance application performance by selectively adapting APIs and services in response to scientific requirements and architectural complexities; and Provide scalable interactive resource management—navigate data and metadata at multiple levels, provide architecture-aware data integration, analysis and visualization tools. We will engage closely with DOE, NASA, and NOAA science groups working at the leading edge of computing. These engagements—in domains such as biology, climate, and hydrology—will allow us to advance disciplinary science goals and inform our development of technologies that can accelerate discovery across DOE more broadly. We will advertise and promote our technologies via dedicated workshops, tutorials, and sessions at conferences, stand-alone events with broad inter-disciplinary invitation, and engagements with leadership facilities.
This project aims to drastically enhance the usability of in situ analysis and visualization for extreme-scale scientific simulations. Current exascale computing capabilities promise to offer greater predictive ability of simulations and to further push the frontiers of science and technology. However, to validate the simulation output at extreme scale, examine the modeled phenomena, and discover previously unknowns from the output data, the output must be reduced or transformed in situ as it is being generated during the simulation such that the amount of data to examine and store is kept to a minimum. Such in situ approaches allow us to process and analyze the data and any embedded geometry to an extent that would be prohibitively expensive, if not impossible, to perform as a post hoc task. While in situ processing has been demonstrated to be a feasible and promising approach, its full potential has not yet been leveraged. In this project, we have developed comprehensive enhancements to in situ technology based on probability distributions in data. Our research focuses on jointly developing new ways of interacting with massive statistical samples while creatively utilizing new state-of-the-art computational resources to push the boundaries of in situ exploration. Moreover, we have developed new time-dependent techniques to enable previously unattainable capabilities in areas such as intelligent simulation steering and precise feature identification. We have experimentally studied our design and implementation at NERSC and OLCF, and are able to leverage existing in situ infrastructures whenever possible. While the exemplar in this project is combustion, many other fields for which turbulent transport is important, e.g., fusion, climate, astrophysics among others, encounter similar issues as simulations scale up to the exascale. This project shows its potential to generate high impact on DOE missions since the resulting technology promises to improve scientists’ ability to rapidly and correctly interpret and tune extreme-scale simulations, leading to new scientific understanding and advancements.
With the increasing penetration of electronic loads and distributed energy resources, conventional load models cannot capture their dynamics. Therefore, a new comprehensive composite load model is developed by Western Electricity Coordinating Council (WECC). However, this model is a complex high-order non-linear system with multi-time-scale property, which poses challenges on power system studies with heavy computational burden. In order to reduce the model complexity, the authors firstly develop a large-signal order reduction (LSOR) method using singular perturbation theory. In this method, the fast dynamics are integrated into the slow ones to preserve transient characteristics of the former. Then, accuracy assessment conditions are proposed and embedded into the LSOR to improve and guarantee the accuracy of reduced-order model. Finally, the reduced-order WECC composite load model is derived by using the proposed algorithm. Overall, simulation results show that the reduced-order large-signal model significantly alleviates the computational burden while maintaining similar dynamic responses as the original composite load model.
Opportunities and constraints for wave energy conversion technologies and projects are evaluated by identifying and characterizing the dominant wave energy systems for United States (US) coastal waters using marginal and joint distributions of the wave energy in terms of the peak period, wave direction, and month. These distributions are computed using partitioned wave parameters generated from a 30 year WaveWatch III model hindcast, and regionally averaged to identify the dominant wave systems contributing to the total annual available energy ( A A E ) for eleven distinct US wave energy climate regions. These dominant wave systems are linked to the wind systems driving their generation and propagation. In addition, conditional resource parameters characterizing peak period spread, directional spread, and seasonal variability, which consider dependencies of the peak period, direction, and month, are introduced to augment characterization methods recommended by international standards. These conditional resource parameters reveal information that supports project planning, conceptual design, and operation and maintenance. The present study shows that wave energy resources for the United States are dominated by long-period North Pacific swells (Alaska, West Coast, Hawaii), short-period trade winds and nor’easter swells (East Coast, Puerto Rico), and wind seas (Gulf of Mexico). Seasonality, peak period spread, and directional spread of these dominant wave systems are characterized to assess regional opportunities and constraints for wave energy conversion technologies targeting the dominant wave systems.
As large-scale scientific simulations and big data analyses become more popular, it is increasingly more expensive to store huge amounts of raw simulation results to perform post-analysis. To minimize the expensive data I/O, "in-situ" analysis is a promising approach, where data analysis applications analyze the simulation generated data on the fly without storing it first. However, it is challenging to organize, transform, and transport data at scales between two semantically different ecosystems due to the distinct software and hardware difference. To tackle these challenges, we design and implement the X-Composer framework. X-Composer connects cross-ecosystem applications to form an "in-situ" scientific workflow, and provides a unified approach and recipe for supporting such hybrid in-situ workflows on distributed heterogeneous resources. X-Composer reorganizes simulation data as continuous data streams and feeds them seamlessly into the Cloud-based stream processing services to minimize I/O overheads. For evaluation, we use X-Composer to set up and execute a cross-ecosystem workflow, which consists of a parallel Computational Fluid Dynamics simulation running on HPC, and a distributed Dynamic Mode Decomposition analysis application running on Cloud. Our experimental results show that X-Composer can seamlessly couple HPC and Big Data jobs in their own native environments, achieve good scalability, and provide high-fidelity analytics for ongoing simulations in real-time.
The Federal Energy Regulatory Commission (FERC) recently issued Order 2222, which requires all wholesale electricity markets in the US to allow distributed energy resources (DERs) to participate in the market as aggregated resources. These DER aggregations may be composed of many individual resources that are offered and dispatched by the market as a single entity. We present here a model of a distributed energy resource aggregator (DERA) that is scheduled by a market operator’s security constrained unit commitment (SCUC) and security constrained economic dispatch (SCED). The DERA model includes constraints for battery energy storage systems (BESSs), demand response resources (DRRs), and a simple distributed energy resource (DER). This paper describes a model for each resource type and presents two methods for the DERA to generate market offer curves: a profit-maximizing optimization to compute cost curves and a direct cost algorithm to determine dispatch costs for each resource and combine into cost curves. Once all participating DERAs are scheduled in SCUC/SCED, the model is then modified to dispatch individual DERs to maximize profit or minimize schedule deviation of the DERAs. A simulation of a representative day illustrates the DERA offers, the scheduled generation, and the DERA dispatch. Findings show the potential for unavoidable schedule deviations due to internal DER constraints and due to economic incentives to deviate from the SCUC/SCED schedules. This highlights the importance of DERA offer construction on market efficiency and system reliability. Novel aspects of our approach include: (1) We consider the asymmetry of price incentives impacting DERAs from the wholesale market compared to those impacting consumers from the retail market, as imposed by current regulations and laws. (2) We model aggregate consumer response through statistically parameterizable utility functions rather than a potentially impractical approach of modeling each individual consumer. (3) We show how to use the DERA operational dispatch model to create offers into the wholesale electricity market. (4) We show how DERAs may fail to meet their scheduled dispatch because the market offer format may not permit them to fully express their operational features such as intertemporal costs and constraints to the market.
Data-driven techniques for energy demand forecasting continue to emerge with promising impacts on distribution grid planning. However, the development of robust and generalizable machine learning models requires that representative high quality training data are available. Distributed energy resources have begun to embed intelligence, gathering large amounts of data on customer demand, behavior, and household devices that are connected to the grid. Though utilities aggregate meter-level demand data for load shaping, demand response, outage management, reliability planning, and billing applications, there lies an inherent privacy concern in sharing consumption data that may identify individual consumer behavioral patterns. Hence, while sharing the data is crucial, the private sensitive customer data must be safeguarded from being exposed or manipulated. In this study, we propose a roadmap for implementing a based privacy preserving framework to support the advancement of data-driven analytics in data-sensitive distributed energy resources environments. The roadmap incorporates federated learning–a distributed training framework, differential privacy–a statistical framework that provides guarantees to safeguard the leakage of sensitive data, secure multiparty computation and homomorphic encryption– techniques for encrypting model gradients and applying secure aggregation on the server. Moreover, we perform baseline experiments on the federated short-term load forecasting (STLF) task using open-source residential load profile datasets, offering insights into the challenges of integrating differential privacy into federated learning.
Adaptive mesh refinement (AMR) is an important method that enables many mesh-based applications to run at effectively higher resolution within limited computing resources by allowing high resolution only where really needed. This advantage comes at a cost, however: greater complexity in the mesh management machinery and challenges with load distribution. With the current trend of increasing heterogeneity in hardware architecture, AMR presents an orthogonal axis of complexity. Additionally, the usual techniques, such as asynchronous communication and hierarchy management for parallelism and memory that are necessary to obtain reasonable performance are very challenging to reason about with AMR. Different groups working with AMR are bringing different approaches to this challenge. Here, we examine the design choices of several AMR codes and also the degree to which demands placed on them by their users influence these choices.
ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.
ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.
The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Though individual consumers are interconnected at the low-voltage distribution system, these resources are typically modeled as variables at the transmission network level. Demand-side participation cannot be leveraged effectively without explicitly including the distribution system dynamics in the optimization-based wholesale market operations. This project grew from a vision for co-optimized interaction of distribution systems, or microgrids, with the high-voltage transmission system. In this framework, microgrids encompass consumers, distributed renewables and storage. The energy management system of the lower voltage system (distribution or microgrid) can also sell (buy) excess (necessary) energy from the transmission system. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. An ideal microgrid is defined as an electric entity capable of operating in both interconnected (with the high-voltage grid) and islanded mode. As such, the microgrid should incorporate generating units (traditional units and intermittent) and if needed, exchange power with the high-voltage grid. The interplay between the microgrid and high-voltage grid motivated the development of the co-optimization approach to ensure efficient performance of the interconnected network. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.
Virtual Power Plants (VPPs) aggregate distributed energy resources (DERs) to provide grid services traditionally delivered by centralized power plants. This article reviews the current state of VPP deployment, highlighting business models, compensation mechanisms, and global pilot projects. While VPPs offer benefits such as grid flexibility, resilience, and cost savings, challenges remain in communication infrastructure, regulatory frameworks, market access, and customer engagement. To address these, we propose a scalable, privacy-preserving hierarchical VPP architecture that coordinates with distribution utilities and preserves customer data. We also present the Integrated T&D Control Room of the Future as a key test bed for validating and accelerating VPP adoption. These innovations can help transition VPPs from pilot programs to integral components of a modern, reliable power grid.
Domain science applications and workflow processes are currently forced to view the network as an opaque infrastructure into which they inject data and hope that it emerges at the destination with an acceptable Quality of Experience. There is little ability for applications to interact with the network to exchange information, negotiate performance parameters, discover expected performance metrics, or receive status/troubleshooting information in real time. The work we presen here is motivated by a vision for a new smart network and smart application ecosystem that will provide a more deterministic and interactive environment for domain science workflows. The Software-Defined Network for End-to-end Networked Science at Exascale (SENSE) system includes a model-based architecture, implementation, and deployment which enables automated end-to-end network service instantiation across administrative domains. An intent based interface allows applications to express their high-level service requirements, an intelligent orchestrator and resource control systems allow for custom tailoring of scalability and real-time responsiveness based on individual application and infrastructure operator requirements. This allows the science applications to manage the network as a first-class schedulable resource as is the current practice for instruments, compute, and storage systems. Deployment and experiments on production networks and testbeds have validated SENSE functions and performance. Emulation based testing verified the scalability needed to support research and education infrastructures. Key contributions of this work include an architecture definition, reference implementation, and deployment. This provides the basis for further innovation of smart network services to accelerate scientific discovery in the era of big data, cloud computing, machine learning and artificial intelligence.