Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributed Computing Resources”

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 1,171 records · Page 65

Probability-Weighted LMP and RCP for Day-Ahead Energy Markets using Stochastic Security-Constrained Unit Commitment: Preprint

Variable renewable generation resources are increasing their penetration on electric power grids. These resources have weather-driven fuel sources that vary on different time scales and are difficult to predict in advance. These characteristics create challenges for system operators managing the load balance on different timescales. Research is looking into new operational techniques andstrategies that show great promise on facilitating greater integration of variable resources. Stochastic Security-Constrained Unit Commitment models are one strategy that has been discussed in literature and shows great benefit. However, it is rarely used outside the research community due to its computational limits and difficulties integrating with electricity markets. This paper discusses howit can be integrated into day-ahead energy markets and especially on what pricing schemes should be used to ensure an efficient and fair market.

17 WIND ENERGY↗

Bringing Federated Identity to Grid Computing

The Fermi National Accelerator Laboratory (FNAL) is facing the challenge of providing scientific data access and grid submission to scientific collaborations that span the globe but are hosted at FNAL. Users in these collaborations are currently required to register as an FNAL user and obtain FNAL credentials to access grid resources to perform their scientific computations. These requirements burden researchers with managing additional authentication credentials, and put additional load on FNAL for managing user identities. Our design integrates the existing InCommon federated identity infrastructure, CILogon Basic CA, and MyProxy with the FNAL grid submission system to provide secure access for users from diverse experiments and collab orations without requiring each user to have authentication credentials from FNAL. The design automates the handling of certificates so users do not need to manage them manually. Although the initial implementation is for FNAL's grid submission system, the design and the core of the implementation are general and could be applied to other distributed computing systems.

Teheran, Jeny↗

Exploring Fine-Grained Task-based Execution on Multi-GPU Systems

Many-core Graphics Processing Units (GPUs) have been utilized as the computation engine in many scientific fields due to the high peak performance, cost effectiveness, and the availability of user friendly programming environments, e.g., NVIDIA CUDA. However, the conventional data parallel GPU programming paradigm cannot satisfactorily address issues such as load balancing and GPU resource utilization due to the irregular and unbalanced workload patterns exhibited in some applications. In this paper, we explore the design space of task-based solutions for multi-GPU systems. By employing finer-grained tasks than what is supported in the current CUDA, and allowing task sharing, our solutions enable dynamic load balancing. We evaluate our solutions with a Molecular Dynamics application with different atom distributions (from uniform distribution to highly non-uniform distribution). Experimental results obtained on a 4-GPU system show that, for non-uniform distributed systems, our solutions achieve excellent speedup, and significant performance improvement over other solutions based on the standard CUDA APIs.

99 GENERAL AND MISCELLANEOUS↗

Scrutinizing Variables for Checkpoint Using Automatic Differentiation

Checkpoint/Restart (C/R) saves the running state of the programs periodically, which consumes considerable time and system resources. We observe that not every piece of data is involved in the computation in typical HPC applications; such unused data should be excluded from checkpointing for better storage and compute efficiency. We propose a systematic approach that leverages automatic differentiation (AD) to scrutinize every element within variables (e.g., arrays) necessary for checkpointing. This allows us to identify critical and uncritical elements and eliminate uncritical elements from checkpointing. Specifically, we inspect every single element within a variable necessary for checkpointing with an AD tool to determine whether the element has an impact on the application output or not. We validate our approach with all benchmarks from the NPB suite. We visualize the distribution of critical and uncritical elements within a variable with respect to its binary impact (yes or no) on the application output.

Huang, Xin [Kobe University]↗

Tigres Workflow Library: Supporting Scientific Pipelines on HPC Systems

The growth in scientific data volumes has resulted in the need for new tools that enable users to operate on and analyze data on large-scale resources. In the last decade, a number of scientific workflow tools have emerged. These tools often target distributed environments, and often need expert help to compose and execute the workflows. Data-intensive workflows are often ad-hoc, they involve an iterative development process that includes users composing and testing their workflows on desktops, and scaling up to larger systems. In this paper, we present the design and implementation of Tigres, a workflow library that supports the iterative workflow development cycle of data-intensive workflows. Tigres provides an application programming interface to a set of programming templates i.e., sequence, parallel, split, merge, that can be used to compose and execute computational and data pipelines. We discuss the results of our evaluation of scientific and synthetic workflows showing Tigres performs with minimal template overheads (mean of 13 seconds over all experiments). We also discuss various factors (e.g., I/O performance, execution mechanisms) that affect the performance of scientific workflows on HPC systems.

97 MATHEMATICS AND COMPUTING↗

Constrained variational optimization of counting-time allocation in sequential scattering measurements: Application to Bonse–Hart USANS

Sequential scattering measurements are often performed under a fixed experimental-time budget, even though the expected count rate varies strongly across the measured coordinate. When the dwell time at each measurement position can be controlled independently, this variation creates a general resource-allocation problem: how should the available time be distributed to minimize the uncertainty of the reconstructed profile? We formulate this problem as a constrained variational optimization for measurements governed by Poisson counting statistics. When each measurement is treated independently, minimizing the averaged squared relative uncertainty yields an inverse-square-root intensity allocation. The formulation is then generalized to include correlations between neighboring measurements and an instrumental resolution operator, leading to an allocation criterion that equalizes the marginal reduction in posterior uncertainty per unit measurement time. Bonse–Hart ultra-small-angle neutron scattering (USANS), in which reciprocal space is sampled sequentially through analyzer-angle stepping, provides an experimentally grounded application. Computational benchmarking shows that the optimized allocation outperforms uniform-time and constant-relative-error strategies, while application to an experimentally measured graphite USANS profile from the Spallation Neutron Source, using Poisson resampling under alternative schedules, demonstrates how counting time should be redistributed toward weak-intensity regions under an identical total duration. The resulting framework applies to sequential scattering and related scanning measurements whenever local dwell times are adjustable and directly determine the measurement uncertainties, and when the relevant correlation and instrumental-response models are available.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

Simplified Transactive Distribution Grids for Bulk Power System Mechanism Development

As distributed energy resources and smart devices become omnipresent in the electrical power grid, transactive energy control mechanisms are evolving. From real-time to day-ahead markets, these transactive energy algorithms involve more and more agents, whose behavior is going to affect the transmission and generation network. In order to study the interaction between the wholesale and retail energy markets, extensive co-simulations are performed. To be able to redesign, evaluate, and verify new control algorithms, the simulations need to provide results in a fast and reliable manner. This work has built and tested a transactive distribution grid model, the DSO-Stub, meant to offer a configurable distribution retail market while ensuring the computational burden is not significantly increased.

Transactive Energy, , Distribution System Operator↗

A Voltage Inference Framework for Real-Time Observability in Active Distribution Grids

Active distribution grids are gaining traction to meet the growing environmental, socio-economic, and sustainability targets. Various advanced smart grid technologies facilitate the integration of Distributed Energy Resources (DERs) by supporting the bi-directional power flow. The limited observability of distribution grids, primarily related to their location at the very edge of power system infrastructure, brings challenges to optimal grid management. Moreover, only a limited number of measurements at regular intervals are usually available. This paper presents a novel inference framework, referred to as “Voltage Inference”, to overcome the observability issues. The proposed framework employs a prediction step based on the Multivariate Taylor series approximation, followed by a corrector step that minimizes the estimation error to infer the otherwise unknown voltages from the available measurements. Furthermore, numerical results on the IEEE 13-bus test feeder validate the accuracy and computational performance of the proposed framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Emergency Voltage Regulation in Power Systems via Ripple-Type Control: Preprint

With increasing penetration of volatile renewable generation and cyber-physical disruptions, ensuring safe operation of bulk power systems has become unprecedentedly challenging. Since communication and computational costs restrict centralized system dispatch to be called upon every few minutes; and purely local schemes are shown to be insufficient, distributed controls have been advocated for handling unanticipated system conditions in real time. However, the applicability of distributed control schemes is fundamentally limited by their need for widespread communication and model cognizance. In this con-text, we put forth a hybrid low-communication saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a ‘hotline’ communication network. Under this protocol, when agents observe a constraint violation based on local measurements, they respond locally until their control resources saturate, in which case they send a beacon for assistance to peer agents. The scheme ensures that minor violations are efficiently mitigated via fast local controls, while severe violations may be handled by a collaboration of a relatively small set of agents. We evaluate the performance of this scheme via extensive numerical tests on the IEEE 14-bus test feeder, where agents act upon noisy measurements under diverse scenarios of random load variations and severe low/high voltage events.

distributed control↗

Developing a Decision Support Engine to Enable Irrigation Modernization - Poster

Irrigation systems in the United States are some of the oldest continually utilized infrastructure in existence today, with some systems exceeding 100 years in age. They are operated to meet farming demands but are managed through a balance of varying influence: policies limiting water usage, stakeholder interests, and environmental impacts. Irrigation modernization is defined as a set of activities that update and improve existing irrigation systems, including, but not limited to improving water quantity, development of distributed energy resources for surrounding communities, ecosystem services, and improved agricultural yields. Modernizing an existing irrigation system can enable stakeholders to combat changing environmental and population demands but is difficult because the complexity involved in determining the potential benefits and consequences of irrigation modernization is high. We are combining a large amount of various geospatial, tabular, and temporal data with subject matter expertise into a decision support engine that will enable stakeholders to determine the benefits and consequences of irrigation modernization in their irrigation systems. A web-based GIS will allow the user to construct the modifications out of a palette of modernization options, which will be sent to the analytics engine for computations, and back to the web client for a graphical display and comparison of relevant metrics. Our development process involves four phases: 1) identify mechanisms of modernization, 2) identify data requirements, data streams, first principles and applicable algorithms necessary to quantify modernization mechanisms, 3) create ‘modules’ for each modernization mechanism, these modules will form the decision support engine, each capable of performing independently but can also inform other modules when needed, 4) Merge the decision support engine with a user interface, capable of ingesting user inputs and returning insights into the impacts of a modernization project as they relate to economic, environmental, monetary, and energy generation. Once complete, it is our intention that this tool will be fundamental in irrigation modernization projects, providing a strong analytical basis from which stakeholders can quickly make informed decisions regarding project development.

13 HYDRO ENERGY↗

Implications of Model Structure and Detail for Utility Planning. Scenario Case Studies using the Resource Planning Model

We examine how model investment decisions change under different model configurations and assumptions related to renewable capacity credit, the inclusion or exclusion of operating reserves, dispatch period sampling, transmission power flow modeling, renewable spur line costs, and the ability of a planning region to import and export power. For all modeled scenarios, we find that under market conditions where new renewable deployment is predominantly driven by renewable portfolio standards, model representations of wind and solar capacity credit and interactions between balancing areas are most influential in avoiding model investments in excess thermal capacity. We also compare computation time between configurations to evaluate tradeoffs between computational burden and model accuracy. From this analysis, we find that certain advanced dispatch representations (e.g., DC optimal power flow) can have dramatic adverse effects on computation time but can be largely inconsequential to model investment outcomes, at least at the renewable penetration levels modeled. Finally, we find that certain underappreciated aspects of new capacity investment decisions and model representations thereof, such as spur lines for new renewable capacity, can influence model outcomes particularly in the renewable technology and location chosen by the model. Though this analysis is not comprehensive and results are specific to the model region, input assumptions, and optimization-modeling framework employed, the findings are intended to provide a guide for model improvement opportunities.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Method of Distributions for Two‐Phase Flow in Heterogeneous Porous Media

Abstract Multiscale heterogeneity and insufficient characterization data for a specific subsurface formation of interest render predictions of multi‐phase fluid flow in geologic formations highly uncertain. Quantification of the uncertainty propagation from the geomodel to the fluid‐flow response is typically done within a probabilistic framework. This task is computationally demanding due to, for example, the slow convergence of Monte Carlo simulations (MCS), especially when computing the tails of a distribution that are necessary for risk assessment and decision‐making under uncertainty. The frozen streamlines method (FROST) accelerates probabilistic predictions of immiscible two‐phase fluid flow problems; however, FROST relies on MCS to compute the travel‐time distribution, which is then used to perform the transport (phase saturation) computations. To alleviate this computational bottleneck, we replace MCS with a deterministic equation for the cumulative distribution function (CDF) of travel time. The resulting CDF‐FROST approach yields the CDF of the saturation field without resorting to sampling‐based strategies. Our numerical experiments demonstrate the high accuracy of CDF‐FROST in computing the CDFs of both saturation and travel time. For the same accuracy, it is about 5 and 10 times faster than FROST and MCS, respectively.

Yang, Hyung Jun↗

Dynamic Airspace Configuration

In air traffic management systems, airspace is partitioned into regions in part to distribute the tasks associated with managing air traffic among different systems and people. These regions, as well as the systems and people allocated to each, are changed dynamically so that air traffic can be safely and efficiently managed. It is expected that new air traffic control systems will enable greater flexibility in how airspace is partitioned and how resources are allocated to airspace regions. In this talk, I will begin by providing an overview of some previous work and open questions in Dynamic Airspace Configuration research, which is concerned with how to partition airspace and assign resources to regions of airspace. For example, I will introduce airspace partitioning algorithms based on clustering, integer programming optimization, and computational geometry. I will conclude by discussing the development of a tablet-based tool that is intended to help air traffic controller supervisors configure airspace and controllers in current operations.

airspace↗

Using bi-directional communications in a market-based resource allocation system

Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

99 GENERAL AND MISCELLANEOUS↗

Using one-way communications in a market-based resource allocation system

Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. In one exemplary embodiment, a plurality of requests for electricity are received from a plurality of end-use consumers. The requests indicate a requested quantity of electricity and a consumer-requested index value indicative of a maximum price a respective end-use consumer will pay for the requested quantity of electricity. A plurality of offers for supplying electricity are received from a plurality of resource suppliers. The offers indicate an offered quantity of electricity and a supplier-requested index value indicative of a minimum price for which a respective supplier will produce the offered quantity of electricity. A dispatched index value is computed at which electricity is to be supplied based at least in part on the consumer-requested index values and the supplier-requested index values.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Risk-Informed Condition Evaluation of Solar-centered Energy Generation and Distribution Networks through Bayesian Learning and Inference

We develop a methodology based on Bayesian inference over Probabilistic Graphical Models (PGMs) to understand and quantify risk in solar-centered grids using targeted measurements and learned system behavior. Being non-prescriptive but, rather, able to infer system behavior and, ultimately, address risk queries from data, our machine learning-type paradigm is tailored for diverse topologies and threat scenarios often associated with distributed energy generation and photovoltaic distributed energy resources (PV-DERs) in particular. We describe algorithmic processes for: (i) learning the structure of PGMs that result from attack-prone PV-DER-proliferated distribution systems, (ii) quantifying cause-effect relationships, and (iii) evaluating risk queries based on diverse evidence. The contributions are illustrated on a residential grid subject to output impairment attacks on its PV-DER infrastructure.

24 POWER TRANSMISSION AND DISTRIBUTION↗

FASDA: An FPGA-Aided, Scalable and Distributed Accelerator for Range-Limited Molecular Dynamics

Conducting long-term simulations of small molecules using Molecular Dynamics (MD) is crucial in drug design. However, traditional methods to accelerate the process including ASICs or GPUs, have limitations. ASICs are difficult to access, while publicly accessible GPU packages for MD have issues with more GPUs when processing small molecules, causing decreased performance. Conversely, FPGAs are renowned for their scalability and have been commonly used as accelerators for various applications, making them suitable for the task. Moreover, with the availability of FPGAs in the cloud, pharmaceutical developers can now access FPGA devices. The only missing piece is a design deployed for MD acceleration. Therefore, we present FASDA, the first FPGA-based MD accelerator available for community development. FASDA is designed to evaluate range-limited MD, which is the most resource-intensive and computationally demanding component in MD. It outperforms the state of-the-art GPU solution by 4.67x, significantly reducing the time for MD in drug design.

Wu, Chunshu↗

Quantifying subsurface parameter and transport uncertainty using surrogate modelling and environmental tracers

Here, we combine physics-based groundwater reactive transport modelling with machine-learning techniques to quantify hydrogeological model and solute transport predictive uncertainties. We train an artificial neural network (ANN) on a dataset of groundwater hydraulic heads and 3 H concentrations generated using a high-fidelity groundwater reactive transport model. Using the trained ANN as a surrogate model to reproduce the input–output response of the high-fidelity reactive transport model, we quantify the posterior distributions of hydrogeological parameters and hydraulic forcing conditions using Markov chain Monte Carlo calibration against field observations of groundwater hydraulic heads and 3 H concentrations. We demonstrate the methodology with a model application that predicts Chlorofluorocarbon-12 (CFC-12) solute transport at a contaminated field site in Wyoming, United States. Our results show that including 3 H observations in the calibration dataset reduced the uncertainty in the estimated permeability field and infiltration rates, compared to calibration against hydraulic heads alone. However, predictive uncertainty quantification shows that CFC-12 transport predictions conditioned to the parameter posterior distributions cannot reproduce the field measurements. We found that calibrating the model to hydraulic head and 3 H observations results in groundwater mean ages that are too large to explain the observed CFC-12 concentrations. The coupling of the physics-based reactive transport model with the machine-learning surrogate model allows us to efficiently quantify model parameter and predictive uncertainties, which is typically computationally intractable using reactive transport models alone.

58 GEOSCIENCES↗