Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Dynamic 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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Improving logistic efficiency of WEEE collection through dynamic scheduling using simulation modeling

Highlights: • Latest EU regulation on WEEE require more flexible logistics models. • The implementation of dynamic scheduling is evaluated for WEEE collection. • A hybrid simulation model compares dynamic (pure and “mixed”) and static collection schemes. • Results confirm the higher flexibility and efficiency of dynamic systems. • Dynamic scheduling “mixed” solutions result more efficient than pure ones. - Abstract: The complexity of collection systems for Waste from Electric and Electronic Equipment (WEEE) in the EU is increasing, due to the latest directive that sets new collection targets and modes. The high variability and the uncertainty of reverse flows require innovative logistic approaches. One recent option for increasing efficiency and responsiveness in waste collection services, boosted by new technological solutions for waste level monitoring, is to adopt a dynamic collection scheme, where the collection frequency is not established a priori (based on a fixed plan), but it is based on the actual filling levels of waste bins. This option can allow the service provider to plan the collection service following the actual demand, resulting in a more responsive service, while improving the logistic efficiency. This paper evaluates the implementation of dynamic scheduling schemes for the collection of WEEE. A hybrid simulation model has been developed in order to support researchers and practitioners in assessing quantitative impacts of adopting dynamic scheduling in WEEE collection. Three logistic alternatives (a fixed collection schedule scheme, a pure dynamic scheme and a mixed one) have been compared in a test case based on data of an Italian municipality; collection services for different types of WEEE (i.e. large appliances and small items) have been analyzed. Results show a promising performance of dynamic schedules compared to the fixed one, revealing, for the specific test case, how a mixed solution can combine the advantages of dynamic and fixed scheduling, gaining flexibility towards customer demand while improving truck resource utilization.

42 ENGINEERING↗
DOE OSTI2024

IRIS: Exploring Performance Scaling of the Intelligent Runtime System and its Dynamic Scheduling Policies

High-Performance Computing is becoming increasingly heterogeneous, relying on a diverse mix of hardware to achieve good performance. Paradoxically, current drivers and frameworks for these devices typically require separate languages and implementations for each vendor. Furthermore, there are few tools and little support to schedule codes between these devices in a truly heterogeneous manner-partly because of this fragmentation between vendors and the languages each supports. To overcome both limitations, the Intelligent Runtime System (IRIS) was developed. It allows a common task abstraction to automatically be shared among contemporary vendors and is run from a single host-side API. At runtime, IRIS queries the host system and registers which frameworks and drivers are available, these determine which kernels can be used by the scheduler-CPUs via OpenMP, Nvidia GPUs (CUDA), AMD GPUs (HIP), and Intel and Xilinx FPGAs with OpenCL. IRIS enables tasks to be scheduled to any heterogeneous device and resolves to the appropriate kernel binary at runtimeit only uses the devices supported by the system on which it is run. IRIS supports single-task and graph-based expressions of dependencies of tasks. Additionally, IRIS features a range of dynamic scheduling policies, allowing complex chains of tasks and interactions to be executed, relieving the programmer/user from considering the system to assign tasks to devices optimally. This paper presents the peak performance attainable by IRIS over a range of systems-each with different numbers and types of accelerator devices, it highlights the flexibility of IRIS since these devices are truly heterogeneous, relying on different backends (drivers, frameworks, and languages) which historically required unique implementations to utilize them. We then use this peak performance as a baseline to compare increasingly complex chains of tasks (with increasingly complex task dependencies) and evaluate how IRIS copes. Finally, we consider the performance of different IRIS scheduling policies on this range of task graphs.

Johnston, Beau↗
DOE OSTI2016

Dynamically Scheduled Region-Based Image Compositing

Algorithms for sort-last parallel volume rendering on large distributed memory machines usually divide a dataset equally across all nodes for rendering. Depending on the features that a user wants to see in a dataset, all the nodes will rarely finish rendering at the same time. Here, existing compositing algorithms do not often take this into consideration, which can lead to significant delays when nodes that are compositing wait for other nodes that are still rendering. In this paper, we present an image compositing algorithm that uses spatial and temporal awareness to dynamically schedule the exchange of regions in an image and progressively composite images as they become available. Running on the Edison supercomputer at NERSC, we show that a scheduler-based algorithm with awareness of the spatial contribution from each rendering node can outperform traditional image compositing algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗
DOE OSTI2023

Multi-Timescale Integrated Dynamics and Scheduling for Solar (MIDAS-Solar) (Final Technical Report)

Solar photovoltaic (PV) installations have experienced unprecedented growth in the United States. PV will become not only an energy producer but also a necessary provider of ancillary services at multiple timescales. Conventional methods to simulate power systems operations - such as long-term production simulation (which typically considers schedules from hours to minutes by using an optimization framework) and short-term transient studies (which simulate dynamics from seconds to sub-seconds using state variables and differential equations) - are not sufficient for studying the multiple-timescale variation of solar generation and its impact on system reliability. Long-term system economics and short-term system dynamics are highly coupled, particularly when the penetration level of renewable generation is extremely high, because the uncertainty and variability of solar generation will impact both power system steady-state and dynamic performance. This project helps meet and exceed the U.S. Department of Energy Office of Energy Efficiency and Renewable Energy Solar Energy Technologies Office goal of systems integration by directly addressing this stability and reliability challenge for power grid planning and operation. We have developed a temporally comprehensive, closed-loop simulation model, named Multi-timescale Integrated Dynamics and Scheduling (MIDAS), that seamlessly simulates power system operations from economic scheduling (day-ahead to hours) to dynamic response analysis (seconds to sub-seconds). For schedules with very high levels of inverter-based resources (IBRs), up to and including 100%, the stability of grid controls has been evaluated through electromagnetic transient (EMT) simulations and power-hardware-in-the-loop (PHIL) simulations of key transient events at key schedule points. Specifically, MIDAS provides: 1) a closed-loop simulation framework for simulating timescales from economic scheduling to dynamic stability analysis; 2) machine learning-based stability assessment; 3) EMT modeling and analysis for large-scale power systems; 4) MIDAS PHIL test bed. We worked with Hawaii Electric Companies to apply the MIDAS study framework to a Maui grid study. The entire island's transmission system was modeled in detail - from a yearly scheduling model, to a second-level frequency dynamic model, down to a sub-second-scale EMT model to address critical stability issues. The project demonstrated how MIDAS can help system planners and operators assess system reliability and stability while the power grid is marching toward a high-renewable, high-IBR future. In this Maui grid study, we found that 100% instantaneous IBR operation is achievable in EMT simulation and PHIL testing, and grid planners and operators might need new analysis/simulation tools to assess grid reliability and stability in the scheduling stage. MIDAS will bring Maui and other systems closer to 100% clean and stable energy futures. (In this study, we examined transient stability. Other topics necessary for 100% IBR operation, such as protection and resource adequacy, were not examined.)

100% Renewables↗
DOE OSTI2022

Low Latency and High Data Rate (LLHD) Scheduler: A Multipath TCP Scheduler for Dynamic and Heterogeneous Networks

The scheduler is a crucial component of the multipath transmission control protocol (MPTCP) that dictates the path that a data packet takes. Schedulers are in charge of delivering data packets in the right order to prevent delays caused by head-of-line blocking. The modern Internet is a complicated network whose characteristics change in real-time. MPTCP schedulers are supposed to understand the real-time properties of the underlying network, such as latency, path loss, and capacity, in order to make appropriate scheduling decisions. However, the present scheduler does not take into account all of these characteristics together, resulting in lower performance. We present the low latency and high data rate (LLHD) scheduler, which successfully makes scheduling decisions based on real-time information on latency, path loss, and capacity, and achieves around 25% higher throughput and 45% lower data transmission delay than Linux’s default MPTCP scheduler.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multi-Timescale Integrated Dynamic and Scheduling Model (MIDAS-Solar)

Solar photovoltaic (PV) installations have experienced unprecedented growth in the United States. PV will become not only an energy producer but also a necessary provider of ancillary services at multiple timescales. Conventional methods to simulate power system operations - such as long-term production simulation (which typically considers schedules from hours to minutes by using an optimization framework) and short-term transient studies (which simulate dynamics from seconds to sub-seconds using state variables and differential equations) are not sufficient for studying the multiple-timescale variation of solar generation and its impact on system reliability. Long-term system economics and short-term system dynamics are highly coupled, particularly when the penetration level of renewable generation is extremely high, because the uncertainty and variability of solar generation will impact both power systems steady-state and dynamic performance. This project helps meet and exceed the Solar Energy Technologies Office goal of systems integration by directly addressing this stability and reliability challenge for electric grid planning and operation. This will be accomplished by developing temporally comprehensive, closed-loop simulation models that seamlessly simulate power systems operations from economic scheduling (day-ahead to hours) to dynamic response analysis (seconds to sub-seconds). Both a multi-timescale grid model and an integrated PV model will be developed in this project to accurately study the impacts of PV variability and uncertainty on system reliability at multiple timescales. Using quasi-dynamic simulation methods and data-driven security assessment (DSA) criteria will allow the dynamic characteristics of PV to be fed forward into longer-timescale scheduling models for a complete understanding of the effect of short-term PV dynamics on bulk systems operations (e.g., reserve scheduling and deployment). Upon completion of the proposed model, this project will help operators accurately assess system reliability by deploying energy and reserve scheduling under critical contingency conditions and studying interactions among all types of essential reliability services provided by modern PV power plants.

14 SOLAR ENERGY↗
DOE OSTI2018

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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Pruning of Discrete Dynamic Event Trees Using Density Peaks and Dynamic Time Warping

Discrete Dynamic Event Trees (DDETs) are used in probabilistic risk assessment (PRA) to determine the risk associated with complex systems, such as nuclear power plants, where accident scenarios need to be realistically modeled. One of the most challenging aspects of the DDET method is that a large number of branches are produced for each initiating event. This can result in data that is difficult to organize and time consuming to analyze. As the number of uncertain parameters increases, so does the complexity of the event tree. An event tree often has nodes that do not contribute to the overall results and predictive capabilities; therefore, we suggest a pre-pruning algorithm that can work to remove these nodes, and consequently, reduce the complexity of the tree. Sandia National Laboratories (SNL) is currently working on a two year dynamic cyber-risk informed project to assess cyber failure in a nuclear power plant. This will be achieved by coupling SNL's dynamic scheduler known as Analysis of Dynamic Accident Progression Trees (ADAPT) with MELCOR, a reactor accident simulator, and a System for Circuit Evaluation and Prediction of Transient Radiation Effects (SCEPTRE), a cyber Emulytics code. This paper will discuss the preliminary results of a feasibility study for using density peaks (DP) clustering with dynamic time warping (DTW) to prune branches that are formed from large DDETs, like the ones that will be produced throughout SNL's project. Papers from the project that are submitted to this conference discuss the following: - The MELCOR model for a Pressurized Water Reactor that uses a digital instrumentation and control system. - Proposed generic cyber exploits for the above reactor. - Modifications to ADAPT to extend the framework for multiple simulators, incorporate importance measures into DDET analysis, as well as sort and reduce DDETs based on inputs to or outputs from the tree. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗
DOE OSTI2024

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗
DOE OSTI2022

Co-optimization of repairs and dynamic network reconfiguration for improved distribution system resilience

In this work, a post-disaster distribution system repair and restoration (DSRR) strategy is proposed to improve distribution system resilience. The DSRR strategy is formulated as a two-stage optimization. The first stage is a comprehensive co-optimization of repair crew scheduling, dynamic network reconfiguration, and distributed energy resource (DER) dispatch based on the forecast load profile. The goal is to minimize the accumulative operating cost caused by the load reduction payment as well as DER operating cost. In particular, since the number of available repair crews is usually smaller than the number of faulted lines after a disaster event, the DSRR strategy determines the optimal scheduling for repairing faulted lines. The second stage is a re-dispatch of the DER power output and load shedding based on the real-time load demand of each bus. The proposed algorithm is validated by case studies of the IEEE 33-bus and 123-bus test systems. We consider those scenarios in which faults occur in multiple heavy-loaded feeders. The simulation results demonstrate that the DSRR strategy effectively coordinate the repair scheduling, network reconfiguration and load shedding to minimize the operating cost.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Elastic distributed training with fast convergence and efficient resource utilization

Distributed learning is now routinely conducted on cloud as well as dedicated clusters. Training with elastic resources brings new challenges and design choices. Prior studies focus on runtime performance and assume a static algorithmic behavior. In this work, by analyzing the impact of of resource scaling on convergence, we introduce schedules for synchronous stochastic gradient descent that proactively adapt the number of learners to reduce training time and improve convergence. Our approach no longer assumes a constant number of processors throughout training. In our experiment, distributed stochastic gradient descent with dynamic schedules and reduction momentum achieves better convergence and significant speedups over prior static ones. Numerous distributed training jobs running on cloud may benefit from our approach.

Cong, Guojing↗
DOE OSTI2016

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗