SEARCH · Search NASA
Results for “Resource 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.
Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network
Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Furthermore, our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm.
Flexible Resource Scheduler for FAST-DERMS (FRS-FASTDERMS) v0.9
The Flexible Resource Scheduler is a hierarchical controller that manages the distributed energy resources in a distribution substation or distribution feeder to provide a firm commitment of power flow at the substation or feeder head to be scheduled in transmission-level markets as an aggregated demand resource. It is the reference controller for the FAST-DERMS Architecture, developed in tandem with the architecture under the DOE FAST-DERMS project. It is comprised of a day-ahead stochastic optimization, which schedules substation power flow and reserves, a intra-hour MPC, which generates dispatch base points for DER, and a real-time PID controller maintaining that dispatches DER to maintain the substation power around the base points. The repository also includes a representative aggregator controller, and all of the necessary components to run a simulation using PNNL's GridAPPS-D software with the controller.
Network reconfiguration and distributed energy resource scheduling for improved distribution system resilience
Electric utility companies work to restore as much load as possible after power outages caused by extreme weather events. In this paper, an outage management strategy is proposed to enhance distribution system resilience through network reconfiguration and distributed energy resources (DERs) scheduling. After a line fault, the proposed algorithm can identify radial network topology based on the rank of the incidence matrix. The reconfiguration is implemented by switching tie lines and sectionalizing lines. With the new network topology, an optimal DER scheduling problem is solved to minimize the accumulative cost for dispatchable DER operation and load reduction. Finally, the optimal topology that minimizes the accumulative cost is selected from all radial topologies. The computational workload is relatively low because only linear programming needs to be solved. Using the case studies of the IEEE 69-bus and IEEE 123-bus systems, we consider the worst-case scenarios in which faults occur in the upstream feeder. The simulation results demonstrate that the proposed strategy allows for a relatively high percentage of the load to remain in service after line faults. Furthermore, compared with microgrid-formation approaches, the proposed strategy has advantages when applied to the distribution systems with several normally-open tie lines and low DER penetration.
14 Steps to Creating Value in Cost and Schedule Resources for Nuclear Waste Management - 20188
While Waste Management budgets are shrinking, DOE required cost and schedule controls are becoming increasingly stringent. At the same time, there is a scarcity of adept, qualified, and competent projects controls staff who both understand nuclear waste management and are capable of addressing today's cost and schedule challenges. In response, we have developed a systematic approach to training and mentoring project controls staff. The approach is based on the observations and lessons learned on projects, both successful and unsuccessful, over the past 20 years. During that time, we evaluated staff development and used that experience to design a program that progresses the maturity, knowledge and experience of the individual. The program is based on the unique needs of cost and schedule specialists while incorporating the best leadership and managerial applications. The system is not limited to developing individual software skills, which is a primary focus of many project controls training programs. Instead, our system develops an individual's soft and hard skill sets. The system develops the user's skill, talent, attitude, and drive to do the best job possible. It focuses on all aspects of becoming a more productive technical team while accepting responsibility for individual growth. It also enhances the project controls team by setting up checks and balances that everyone is aware of and participates in. The system is based on 14 steps of increasing complexity in knowledge and application. The system clarifies roles, responsibilities and expectations. It helps eliminate uncertainty and reduces stress on staff and managers. It contains everyday routine actions and is simple to implement. It allows the development of a consistent rhythm to staff growth and development. Mastering the steps will allow the user to achieve excellence in cost and schedule control. The 14 steps are: 1 - Key Performance Objectives, 2 - Check Lists, 3 - Desktop Guides, 4 - System Description, 5 - Procedures, 6 - Software and On the Job Training (OTJ), 7 - Traceability Checks, 8 - Surveillances, 9 - 32 Criteria, 10 - The Contract, 11 - Customer/Government Guidance, 12 - Training and Mentoring Others, 13 - Master your weekly and daily schedules, 14 - Improving your interpersonal skills. Application and mastery of this system will produce better cost and schedule control results. Your project controls staff will write better reports, analyze data better, make better use of their time, and be more valuable to decision makers. If followed rigorously, our system will produce a great project controls team, which is invaluable to the success of each project. (authors)
Repair and Resource Scheduling in Unbalanced Distribution Systems Using Neighborhood Search
—This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed. We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignmentbased method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.
Fermilab HEPCloud Facility Decision Engine Design
The Decision Engine is a critical component of the HEP Cloud Facility. It provides the functionality of resource scheduling for disparate resource providers, including those which may have a cost or a restricted allocation of cycles. Along with the architecture, design, and requirements for the Decision Engine, this document will provide the rationale and explanations for various design decisions. In some cases, requirements and interfaces for a limited subset of external services will be included in this document. This document is intended to be a high level design. The design represented in this document is not complete and does not break everything down in detail. The class structures and pseudo-code exist for example purposes to illustrate desired behaviors, and as such, should not be taken literally. The protocols and behaviors are the important items to take from this document. This project is still in prototyping mode so flaws and inconsistencies may exist and should be noted and treated as failures.
A stochastic optimal power flow for scheduling flexible resources in microgrids operation
Not Available
Energy and Power Aware Job Scheduling and Resource Management: Global Survey ?.
Abstract not provided.
The problem analysis of data processing performance in nuclear power plant computerized information and control system - 288
This paper is based on the data processing performance problems of operating command delay and system display not updating real-time for nuclear power plant computerized information and control system. The plant computerized information and control system is responsible for monitoring and controlling the plant operation, and it is a key part in the plant DCS system. Its data processing performance will affect the operation stability of nuclear power plant. The architecture, hardware configuration and data communication for plant computerized information and control system among the different levels in DCS are described. The main reasons affecting data processing performance in different signal channels are analyzed according to the plant load test results. The CPU load curves for real time server and central processing server are displayed, although the detailed cause for operating command delay and system display not updating realtime are not found, central processing server load is heavier than real time server which remind us to analyze the data processing of software resource scheduling deeply. So the resource distribution problem of software execution task is also analyzed according to CPU load test results. This paper provides the optimization analysis for data processing performance, and it is available and effective according to the latest test results. (authors)
A Length Adaptive Algorithm-Hardware Co-design of Transformer on FPGA Through Sparse Attention and Dynamic Pipelining
Transformers are considered one of the most important deep learning models since 2018, in part because it establishes state-of-the-art (SOTA) records and could potentially replace existing Deep Neural Networks (DNNs). Despite the remarkable triumphs, the prolonged turnaround time of Transformer models is a widely recognized roadblock. The variety of sequence lengths imposes additional computing overhead where inputs need to be zero-padded to the maximum sentence length in the batch to accommodate the parallel computing platforms. This paper targets the field-programmable gate array (FPGA) and proposes a coherent sequence length adaptive algorithm–hardware co-design for Transformer acceleration. Particularly, we develop a hardware-friendly sparse attention operator and a length-aware hardware resource scheduling algorithm. The proposed sparse attention operator brings the complexity of attention-based models down to linear complexity and alleviates the off-chip memory traffic. The proposed length-aware resource hardware scheduling algorithm dynamically allocates the hardware resources to fill up the pipeline slots and eliminates bubbles for NLP tasks. Experiments show that our design has very small accuracy loss and has 80.2 × and 2.6 × speedup compared to CPU and GPU implementation, and 4 × higher energy efficiency than state-of-the-art GPU accelerator optimized via CUBLAS GEMM.
A Heterogeneity-Aware Task Scheduler for Spark
Big data processing systems such as Spark are employed in an increasing number of diverse applications-such as machine learning, graph computation, and scientific computing-each with dynamic and different resource needs. These applications increasingly run on heterogeneous hardware, e.g., with out-of-core accelerators. However, big data platforms do not factor in the multi-dimensional heterogeneity of applications and hardware. This leads to a fundamental mismatch between the application and hardware characteristics, and the resource scheduling adopted in big data platforms. For example, Hadoop and Spark consider only data locality when assigning tasks to nodes, and typically disregard the hardware capabilities and suitability to specific application requirements. In this paper, we present RUPAM, a heterogeneity-aware task scheduling system for big data platforms, which considers both task-level resource characteristics and underlying hardware characteristics, as well as preserves data locality. RUPAM adopts a simple yet effective heuristic to decide the dominant scheduling factor (e.g., CPU, memory, or I/O), given a task in a particular stage. Our experiments show that RUPAM is able to improve the performance of representative applications by up to 62.3% compared to the standard Spark scheduler.
NUMA-Aware Thread Scheduling for Big Data Transfers over Terabits Network Infrastructure
The evergrowing trend of big data has led scientists to share and transfer the simulation and analytical data across the geodistributed research and computing facilities. However, the existing data transfer frameworks used for data sharing lack the capability to adopt the attributes of the underlying parallel file systems (PFS). LADS (Layout-Aware Data Scheduling) is an end-to-end data transfer tool optimized for terabit network using a layout-aware data scheduling via PFS. However, it does not consider the NUMA (Nonuniform Memory Access) architecture. In this paper, we propose a NUMA-aware thread and resource scheduling for optimized data transfer in terabit network. First, we propose distributed RMA buffers to reduce memory controller contention in CPU sockets and then schedule the threads based on CPU socket and NUMA nodes inside CPU socket to reduce memory access latency. We design and implement the proposed resource and thread scheduling in the existing LADS framework. Experimental results showed from 21.7% to 44% improvement with memory-level optimizations in the LADS framework as compared to the baseline without any optimization.
Energy-efficient cooperative resource allocation and task scheduling for Internet of Things environments
Offloading Internet of Things (IoT) tasks to the cloud for further processing might not always lead to an optimal execution time, particularly in situations such as resource contention, under-provisioning, over-provisioning, and fragmentation. In addition, dynamically optimizing the number of Virtual Machines (VMs) for resource scheduling in order to meet application requirements remains a major research challenge. Further, existing resource scheduling algorithms focus primarily on minimizing operational costs while maximizing resource sharing and utilization. Considering energy utilization as part of the resource allocation and scheduling process as an optimization objective for maintaining load balancing has often been neglected. To address these challenges and more, we propose a cooperative energy-aware resource allocation and scheduling strategy based on a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) multi-criteria decision-making method. Here we used the Grid Workloads Archive dataset to evaluate our proposed approach named TOPREAL. Experimental results with respect to the allocation of VM resources when considering processing a large segment of tasks indicate that TOPREAL outperforms existing algorithms in terms of energy savings, with an average improvement of 40.25%, while maintaining an average improvement of 16.21% when it comes to execution time. Results also demonstrate that our method can save an average of 78.06 processing hours and 63,215kJ of energy when compared to existing scheduling algorithms. These results demonstrate the effectiveness of our proposed model and the viability of using multi-criteria decision-making techniques such as TOPSIS to solve the resource allocation and scheduling problem in edge environments.
Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights
Maintaining resource fairness while achieving optimization for various performance metrics such as resource utilization, turnaround time and job latency is a well-known resource scheduling challenge in cloud computing. Despite the significant progress made with the introduction of dominant resource fairness by Ghodsi et al., which ensures major allocation properties such as sharing incentive, strategy-proofness, envy-freeness and Pareto efficiency to be achieved
Application of Banking Scoring and Rating for Coherent Risk Measures in Electricity Systems ABSCORES
This project developed a framework for asset and system risk management that can be incorporated into current electricity system operations to improve economic efficiency and establish an Electric Assets Risk Bureau. We leveraged scoring and ratings from banking and financial institutions alongside current optimization methods in dispatching power systems to help system operators and electricity markets schedule resources. This approach is based on the observation that there are major discrepancies between the power scheduled by a system operator and the actual power generated/consumed. These discrepancies—exacerbated by unplanned contingencies (e.g., natural disasters)—are caused by multiple factors, including the different financial, environmental and risk preferences of power producers, consumers, and aggregators. We developed a framework that counteracts two failures in electricity system operations: imperfect information and missing markets for products. The technical approach included five tasks. Tasks 1 and 2 supported the development of risk scores at the asset level with historical data collected for this project. Tasks 3, 4, and 5 incorporated scoring into decision-making at the system level. The proposed effort achieved PERFORM's Program Objectives because the proposed outputs and algorithms do not exist in the electricity industry and are an innovative approach to managing risk. Since the acknowledged need to better assess and act upon risk profiles for grid assets has not been met by the industry, this project will also impact ARPA-E's Mission Areas, including improving energy efficiency and giving the U.S. a technological lead in advanced energy technologies.
Lifting and Dropping VMs to Dynamically Transition Between Time- and Space-sharing for Large-Scale HPC Systems
As HPC environments increasingly integrate with edge based systems, system architectures will need to handle a broader class of workloads and scheduling requirements. One result of this shift will be the need to simultaneously support bulk-synchronous parallel (BSP) and on-demand service based applications on the same infrastructure. This in turn will require that future resource management approaches utilize both space-shared as well as time-shared resource scheduling strategies. In this work we introduce the concept of "VM-lifting'' (and its inverse "VM-Dropping'') which allows dynamically switching an HPC workload between space-shared and time-shared scheduling regimes. Our work targets co-kernel based HPC system software environments, in which multiple specialized OS kernels execute natively on dedicated physical resource partitions inside a single compute node. With VM-lifting, a native co-kernel can be migrated at runtime to and from locally hosted Virtual Machine Environments due to changing scheduling requirements of the node. This allows an HPC node to be dynamically (re-)configured as either a time-shared Infrastructure-as-a-Service (IaaS) resource or a dedicated space shared resource based on the current workload demands. We have implemented this approach in the context of the Hobbes Exascale System Software stack and have demonstrated that a node can be reconfigured with minimal impact on the running applications.