Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid scheduling”

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 19 records

The NCRC Grid Scheduling Environment

In support of the NCRC, a joint computing center between NOAA and ORNL, a grid-based scheduling infrastructure was designed to allow geographically separate computing resources to be used as production resources in climate and weather research workflows. These workflows require job coordination between the two centers in order to provide a complete workflow of data staging, computation, post-analysis and archival. This paper details the design, implementation and initial production phase of the infrastructure and lessons learned from the process.

99 GENERAL AND MISCELLANEOUS↗

Grid scheduling divisible loads from two sources

To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks with two load originating processors. Solutions for an optimal allocation of fractions of load to nodes in single level tree networks are obtained via linear programming. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each processor in the network is also presented. The tradeoff between linear programming and closed form solutions in terms of underlying assumptions is examined. Finally, a performance evaluation of a two source homogeneous single level tree network with concurrent communication strategy is presented.

97 MATHEMATICS AND COMPUTING↗

Using Grid Benchmarks for Dynamic Scheduling of Grid Applications

Navigation or dynamic scheduling of applications on computational grids can be improved through the use of an application-specific characterization of grid resources. Current grid information systems provide a description of the resources, but do not contain any application-specific information. We define a GridScape as dynamic state of the grid resources. We measure the dynamic performance of these resources using the grid benchmarks. Then we use the GridScape for automatic assignment of the tasks of a grid application to grid resources. The scalability of the system is achieved by limiting the navigation overhead to a few percent of the application resource requirements. Our task submission and assignment protocol guarantees that the navigation system does not cause grid congestion. On a synthetic data mining application we demonstrate that Gridscape-based task assignment reduces the application tunaround time.

Frumkin, Michael↗

Valuing Maintenance Strategies for Fusion Plants as Part of a Future Electricity Grid

Scheduled maintenance is likely to be lengthy and therefore consequential for the economics of fusion power plants. The maintenance strategy that maximizes the economic value of a plant depends on internal factors such as the cost and durability of the replaceable components, the frequency and duration of the maintenance blocks, and the external factors of the electricity system in which the plant operates. Here, this paper examines the value of fusion power plants with various maintenance properties in a decarbonized United States Eastern Interconnection circa 2050. Seasonal variations in electricity supply and demand mean that certain times of year, particularly spring to early summer, are best for scheduled maintenance. Seasonality has two important consequences. First, the value of a plant can be 15% higher than what one would naively expect if value were directly proportional to its availability. Second, in some cases, replacing fractions of a component in shorter maintenance blocks spread over multiple years is better than replacing it all at once during a longer outage, even through the overall availability of the plant is lower in the former scenario.

power plant, maintenance, seasonality, electricity↗

Applicability of Markets to Global Scheduling in Grids: Critical Examination of General Equilibrium Theory and Market Folklore

Markets are often considered superior to other global scheduling mechanisms for distributed computing systems. This claim is supported by: a casual observation from our every-day life that markets successfully equilibrate supply and demand, and the features of markets which originate in the general equilibrium theory, e.g., efficiency and the lack of necessity of 2 central controller. This paper describes why such beliefs in markets are not warranted. It does so by examining the general equilibrium theory, in terms of scope, abstraction, and interpretation. Not only does the general equilibrium theory fail to provide a satisfactory explanation of actual economies, including a computing-resource economy, it also falls short of supplying theoretical foundations for commonly held views of market desirability. This paper also points out that the argument for the desirability of markets involves circular reasoning and that the desirability can be established only vis-a-vis a scheduling goal. Finally, recasting the conclusion of Arrow's Impossibility Theorem as that for global scheduling, we conclude that there exists no market-based scheduler that is rational (in the sense defined in microeconomic theory), takes into account utility of more than one user, and yet yields a Pareto-optimal outcome for arbitrary user utility functions.

Nakai, Junko↗

Job Scheduling in a Heterogeneous Grid Environment

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

Shan, Hong-Zhang↗

Scalable Unit Commitment with Security Constrained AC Power Flow via ADMM and Hybrid Modeling Strategies

This research introduces a more efficient way to optimize power grid operations, breaking the problem into manageable steps and using advanced mathematical techniques to speed up calculations. By incorporating smart heuristics, improved preprocessing, and contingency analysis, the approach allows operators to make better decisions faster. These innovations enhance our understanding of how to optimize energy generation, making it possible to anticipate failures before they happen, reduce system costs, and improve overall grid performance. Ultimately, this research helps bridge the gap between theoretical models and real-world applications, paving the way for a smarter, more resilient power grid. This research directly benefits the public by making electricity more affordable, reliable, and sustainable. By improving how power grids schedule and distribute electricity, the project helps energy providers reduce operational costs, which can lead to lower electricity prices for consumers. Additionally, the ability to predict and prevent power system failures enhances grid reliability, reducing the likelihood of blackouts that can disrupt homes, businesses, and critical infrastructure such as hospitals. From an environmental perspective, optimizing power generation reduces energy waste and lowers carbon emissions, contributing to cleaner air and a more sustainable energy system. Furthermore, with extreme weather events becoming more frequent, these advancements make the power grid more resilient, ensuring communities are better prepared for emergencies and natural disasters. By strengthening the nation's energy infrastructure, this research plays a crucial role in improving economic stability, public safety, and environmental sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Decision Support Framework for Grid-Aware Electric Bus Charge Scheduling

While there are many advantages to electric public transit vehicles, they also pose new challenges for fleet operators. One key challenge is defining a charge scheduling policy that minimizes operating costs and power grid disruptions while maintaining schedule adherence. An uncoordinated policy could result in some buses running out of charge before completing their trip, while a grid agnostic policy might incur higher energy costs or cause an adverse impact on the grid’s distribution system. We present a grid aware decision-theoretic framework for electric bus charge scheduling that accounts for energy price, grid load, and bus status. The framework connects environmental models for traffic (SUMO) and the electric grid (GridLAB-D) to a planner, which evaluates bus charging decisions with regard to their long-term effect on grid reliability and cost. The framework has been evaluated on a simulation of Richland, WA’s bus and grid network, and compared to greedy methods.

EV, machine leaning, EV-Grid, Transportation, Grid↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown to be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

97 MATHEMATICS AND COMPUTING↗

A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

An economic assessment of behind-the-meter photovoltaics paired with batteries on the Hawaiian Islands.

Due to natural variability and uncertainty, the ever-increasing penetration of solar generation in Hawaii presents challenges to power grid operators to maintain reliable system operation. Demand response (DR) has the potential to be a cost-effective tool for Hawaii to reach its aggressive renewable energy goals while maintaining the reliability of power grids. The Hawaii Public Utilities Commission has approved the Hawaiian Electric Company's revised portfolio of DR programs. The companies have released a grid services purchase agreement and subscribed an initial tranche of load into their DR programs. This paper presents innovative analytical methods and comprehensive economic assessment for distributed photovoltaics (PV) paired with battery energy storage systems (BESSs) for two new DR programs, including fast frequency response and capacity grid service. Optimal dispatch and sizing methods are proposed for the paired system considering different tariff schedules and PV compensation programs across five islands. It was found that while the best resource configuration and potential economic benefits vary with tariff structure, a BESS paired with PV can be optimally dispatched to generate multiple value streams simultaneously. Compensation from DR programs is an important value stream to help increase the cost-effectiveness of the integrated system.

Battery energy storage system↗

gollnlp and magos (Final Scientific/Technical Report)

In 2018, the Advanced Research Project Agency – Energy (ARPA-E) launched the Grid Optimization Competition (GOC), a series of competitive challenges intended to accelerate innovation in decision support software used to schedule power grid operations, making them as efficient as possible, while respecting operational constraints of power equipment and operational security. This report covers the participation of teams led by the Lawrence Livermore National Laboratory (LLNL) in Challenge 1 and Challenge 2 of the competition.

24 POWER TRANSMISSION AND DISTRIBUTION↗

LLGoMAX : Enhancing Industry-Standard Tools for AC Optimal Unit Commitment

In 2018, the Advanced Research Project Agency – Energy (ARPA-E) launched the Grid Optimization Competition (GOC) [1], a series of competitive challenges intended to accelerate innovation in decision support software used to schedule power grid operations, making them as efficient as possible, while respecting operational constraints of power equipment and operational security. This report covers the participation of the LLGoMAX team—a collaboration of the Lawrence Livermore National Laboratory (LLNL) and ECCO International, Inc.—in Challenge 3 of the competition.

97 MATHEMATICS AND COMPUTING↗

Grid Service for User-Centric Job

The User Centric Monitoring (UCM) project was aimed at developing a toolkit that provides the Virtual Organization (VO) with tools to build systems that serve a rich set of intuitive job and application monitoring information to the VO’s scientists so that they can be more productive. The tools help collect and serve the status and error information through a Web interface. The proposed UCM toolkit is composed of a set of library functions, a database schema, and a Web portal that will collect and filter available job monitoring information from various resources and present it to users in a user-centric view rather than and administrative-centric point of view. The goal is to create a set of tools that can be used to augment grid job scheduling systems, meta-schedulers, applications, and script sets in order to provide the UCM information. The system provides various levels of an application programming interface that is useful through out the Grid environment and at the application level for logging messages, which are combined with the other user-centric monitoring information in a abstracted “data store”. A planned monitoring portal will also dynamically present the information to users in their web browser in a secure manor, which is also easily integrated into any JSR-compliant portal deployment that a VO might employ. The UCM is meant to be flexible and modular in the ways that it can be adopted to give the VO many choices to build a solution that works for them with special attention to the smaller VOs that do not have the resources to implement home-grown solutions.

99 GENERAL AND MISCELLANEOUS↗