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 163 records · Page 9

Dynamic advance reservation with delayed allocation

A method of scheduling data transmissions from a source to a destination, includes the steps of: providing a communication system having a number of channels and a number of paths, each of the channels having a plurality of designated time slots; receiving two or more data transmission requests; provisioning the transmission of the data; receiving data corresponding to at least one of the two or more data transmission requests; waiting until an earliest requested start time T.sub.s; allocating at the current time each of the two or more data transmission requests; transmitting the data; and repeating the steps of waiting, allocating, and transmitting until each of the two or more data transmission requests that have been provisioned for a transmission of data is satisfied. A system to perform the method of scheduling data transmissions is also described.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Task Based Approach for Co-Scheduling Ensemble Workloads on Heterogeneous Nodes

Scientific workflows consist of multiple, connected applications, with data and results flowing from one to another in a pipeline. Traditionally, such workflows are executed in sequential order, storing intermediate data in storage disks. Co-scheduling application workflows concurrently on the same compute nodes would greatly reduce the cost of moving data to/from storage and allow real-time analysis of intermediate results. Nevertheless, most parallel programming runtimes do not allow seamless integration of various applications in a scientific workflow, in part due to the complexity of managing data and resources. The situation is even more complicated for heterogeneous systems. In this work we extend the Minos Computing Library (MCL) runtime to accelerate pipe-lined and parallel workloads where multiple applications are running in the same system. MCL’s asynchronous task library and runtime dynamically manages resources to allow co-scheduling of multiple processes sharing heterogeneous resources. In addition, we design a custom ex- tension of the Open Compute Language (OpenCL) to enable multiple processes to share device memory. We enable MCL to coordinate these shared buffers to allow for easy, fast data sharing between applications. Using malleable micro-benchmarks and two application workflows that combine scientific simulation and AI-based analysis, we show that our method outperforms traditional approaches.

Index Terms—Parallel systems, Scheduling and Task ↗

Dynamic Workflows for Routine Materials Discovery in Surface Science

The rising application of informatics and data science tools for studying inorganic crystals and small molecules has revolutionized approaches to materials discovery and driven the development of accurate machine learning structure/property relationships. In this paper, we discuss how informatics tools can accelerate research, and we present various combinations of workflows, databases, and surrogate models in the literature. This paradigm has been slower to infiltrate the catalysis community due to larger configuration spaces, difficulty in describing necessary calculations, and thermodynamic/kinetic quantities that require many interdependent calculations. We present our own informatics tool that uses dynamic dependency graphs to share, organize, and schedule calculations to enable new, flexible research workflows in surface science. This approach is illustrated for the large-scale screening of intermetallic surfaces for electrochemical catalyst activity. Similar approaches will be important to bring the benefits of informatics and data science to surface science research. Lastly, we provide our perspective on when to use these tools and considerations when creating them.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ALTRIOS (Advanced Locomotive Technology and Rail Infrastructure Optimization System) [SWR-22-54]

The Advanced Locomotive Technology and Rail Infrastructure Optimization System (ALTRIOS) is a unique, fully integrated, open-source software tool to evaluate strategies for deploying advanced locomotive technologies and associated infrastructure for cost-effective decarbonization. ALTRIOS simulates freight-demand driven train scheduling, mainline meet-pass planning, locomotive dynamics, train dynamics, energy conversion efficiencies, and energy storage dynamics of line-haul train operations. Because new locomotives represent a significant long-term capital investment and new technologies must be thoroughly demonstrated before deployment, this tool provides guidance on the risk/reward tradeoffs of different technology rollout strategies. An open, integrated simulation tool is invaluable for identifying future research needs and making decisions on technology development, routes, and train selection. ALTRIOS was developed as part of a collaborative effort by a team comprising the National Renewable Energy Laboratory (NREL), University of Illinois Urbana-Champaign (UIUC), Southwest Research Institute (SwRI), and BNSF Railway. Python Package: https://pypi.org/project/altrios/ Rust Crate: https://crates.io/crates/altrios-core

Baker, Chad↗

Characterizing the Performance of Executing Many-tasks on Summit

Many scientific workloads are comprised of many tasks, where each task is an independent simulation or analysis of data. The execution of millions of tasks on heterogeneous HPC platforms requires scalable dynamic resource management and multi-level scheduling. RADICAL-Pilot (RP) -- an implementation of the Pilot abstraction, addresses these challenges and serves as an effective runtime system to execute workloads comprised of many tasks. In this paper, we characterize the performance of executing many tasks using RP when interfaced with JSM and PRRTE on Summit: RP is responsible for resource management and task scheduling on acquired resource; JSM or PRRTE enact the placement of launching of scheduled tasks. Our experiments provide lower bounds on the performance of RP when integrated with JSM and PRRTE. Specifically, for workloads comprised of homogeneous single-core, 15 minutes-long tasks we find that: PRRTE scales better than JSM for > O(1000) tasks; PRRTE overheads are negligible; and PRRTE supports optimizations that lower the impact of overheads and enable resource utilization of 63% when executing O(16K), 1-core tasks over 404 compute nodes.

Matteo, Turilli↗

Free energy reconstruction from steered dynamics without post-processing

Various methods achieving importance sampling in ensembles of nonequilibrium trajectories enable one to estimate free energy differences and, by maximum-likelihood post-processing, to reconstruct free energy landscapes. Here, based on Bayes theorem, we propose a more direct method in which a posterior likelihood function is used both to construct the steered dynamics and to infer the contribution to equilibrium of all the sampled states. The method is implemented with two steering schedules. First, using non-autonomous steering, we calculate the migration barrier of the vacancy in Fe-{alpha}. Second, using an autonomous scheduling related to metadynamics and equivalent to temperature-accelerated molecular dynamics, we accurately reconstruct the two-dimensional free energy landscape of the 38-atom Lennard-Jones cluster as a function of an orientational bond-order parameter and energy, down to the solid-solid structural transition temperature of the cluster and without maximum-likelihood post-processing.

97 MATHEMATICS AND COMPUTING↗

Ant Colony Optimization for Mapping, Scheduling and Placing in Reconfigurable Systems

Modern heterogeneous embedded platforms, com- posed of several digital signal, application specific and general purpose processors, also include reconfigurable devices support- ing partial dynamic reconfiguration. These devices can change the behavior of some of their parts during execution, allowing hardware acceleration of more sections of the applications. Never- theless, partial dynamic reconfiguration imposes severe overheads in terms of latency. For such systems, a critical part of the design phase is deciding on which processing elements (mapping) and when (scheduling) executing a task, but also how to place them on the reconfigurable device to guarantee the most efficient reuse of the programmable logic. In this paper we propose an algorithm based on Ant Colony Optimization (ACO) that simultaneously executes the scheduling, the mapping and the linear placing of tasks, hiding reconfiguration overheads through prefetching. Our heuristic gradually constructs solutions and then searches around the best ones, cutting out non-promising areas of the design space. We show how to consider the partial dynamic reconfiguration constraints in the scheduling, placing and mapping problems and compare our formulation to other heuristics that address the same problems. We demonstrate that our proposal is more general and robust, and finds better solutions (16.5% in average) with respect to competing solutions.

Ant Colony Optimization↗

Topology, criticality, and dynamically generated qubits in a stochastic measurement-only Kitaev model

Here we consider a paradigmatic solvable model of topological order in two dimensions, Kitaev's honeycomb Hamiltonian, and turn it into a measurement-only dynamics consisting of stochastic measurements of two-qubit bond operators. We find an entanglement phase diagram that resembles that of the Hamiltonian problem in some ways, while being qualitatively different in others. When one type of bond is dominantly measured, we find area-law entangled phases that protect two topological qubits (on a torus) for a time exponential in system size. This generalizes the recently proposed idea of Floquet codes, where logical qubits are dynamically generated by a time-periodic measurement schedule, to a stochastic setting. When all types of bonds are measured with comparable frequency, we find a critical phase with a logarithmic violation of the area law, which sharply distinguishes it from its Hamiltonian counterpart. The critical phase has the same set of topological qubits, as diagnosed by the tripartite mutual information, but protects them only for a time polynomial in system size. Furthermore, we observe an unusual behavior for the dynamical purification of mixed states, characterized at late times by the dynamical exponent z = $\frac{1}{2}$ a superballistic dynamics made possible by measurements.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An Agent-Based Modeling Approach for Spatiotemporal Optimization of Electric Vehicle Fast-Charging Station Demand

With increasing electric vehicle (EV) adoption, managing public fast-charging demand effectively is crucial to avoid grid strain. This study investigates the potential of using dynamic pricing schemes to address this challenge. Presented in this study is a scalable agent-based simulation framework, which is applied to a case study in Richmond, Virginia, that assumes a 50% EV adoption rate in 2040. Two pricing schemes are compared: (1) a dynamic-pricing scheme based on station utilization and (2) a dynamic-pricing scheme based on peak power at the station. These schemes are compared to two baseline scenarios: (1) unscheduled first-come, first-served and (2) scheduled with constant price. The study’s results suggest that dynamic pricing has the potential to influence EV charging behavior, inducing both spatial and temporal shifts, but does so at the cost of inducing inconvenience to EV drivers. The results suggest the peak-power dynamic pricing scheme has the potential to mitigate peak demand pressures on the grid with minimal inconvenience, offering a promising approach for sustainable EV charging infrastructure expansion.

33 - ADVANCED PROPULSION SYSTEMS↗

Thermostat Interface and Usability: A Survey

This report investigates the history of thermostats to better understand the context and legacy regarding the development of this important tool, as well as thermostats' relationships to heating, cooling, and other environmental controls. We analyze the architecture, interfaces, and modes of interaction used by different types of thermostats. For over sixty years, home thermostats have translated occupants' temperature preferences into heating and cooling system operations. In this position of an intermediary, the millions of residential thermostats control almost half of household energy use, which corresponds to about 10percent of the nation's total energy use. Thermostats are currently undergoing rapid development in response to emerging technologies, new consumer and utility demands, and declining manufacturing costs. Energy-efficient homes require more careful balancing of comfort, energy consumption, and health. At the same time, new capabilities will be added to thermostats, including scheduling, control of humidity and ventilation, responsiveness to dynamic electricity prices, and the ability to join communication networks inside homes. Recent studies have found that as many as 50percent of residential programmable thermostats are in permanent"hold" status. Other evaluations found that homes with programmable thermostats consumed more energy than those relying on manual thermostats. Occupants find thermostats cryptic and baffling to operate because manufacturers often rely on obscure, and sometimes even contradictory, terms, symbols, procedures, and icons. It appears that many people are unable to fully exploit even the basic features in today's programmable thermostats, such as setting heating and cooling schedules. It is important that people can easily, reliably, and confidently operate thermostats in their homes so as to remain comfortable while minimizing energy use.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

HCPerf: Driving Performance-Directed Hierarchical Coordination for Autonomous Vehicles

The rapid development of autonomous driving poses new research challenges to the on-vehicle computing system. In particular, the execution time of autonomous driving tasks highly depends on the specific driving environment. For instance, the execution time of configurable sensor fusion increases significantly as the scene becomes complex, which leads to end-to-end deadline misses from sensing to control and may cause accidents. Thus, a framework that can effectively utilize the system resources to guarantee the end-to-end deadlines of autonomous driving tasks as well as effectively prioritize the responsiveness and throughput of the control commands is crucial for autonomous driving. In this paper, we propose HCPerf, a performance-directed hierarchical coordination framework that intelligently coordinates the autonomous driving tasks with high execution time variation and complex dependencies according to the driving performance in real-time. Specifically, HCPerf mainly consists of two coordinators. The internal coordinator intelligently schedules the tasks according to the driving performance of the vehicle in order to help them meet the end-to-end deadlines while well prioritizing the responsiveness and throughput of the control commands. At the same time, the external coordinator dynamically tunes the rates of tasks according to the schedulability in order to efficiently utilize the system resource. We conduct extensive experiments on both simulation and hardware testbeds with the representative autonomous driving application. The results show that HCPerf can effectively improve the driving performance by 7.69%-45.94% in different driving scenarios.

Ma, Jialiang↗

Circular Economy for Photovoltaics in Service of Energy Transition

The challenge of energy transition is immediate and immense; current projections target 75 TW of photovoltaics (PV) capacity by 2050. While any transition to renewable energy technology is preferable to the current fossil-based system, it is ideal to improve the sustainability of PV to minimize negative environmental and social impacts. Circular economy (CE) has been proposed as a method to improve the sustainability of PV, especially for emerging materials like perovskites. CE is a set of actions, principles, and systems which aim to design out waste and keep products and materials in use, to reduce environmental impacts and enable sustainable development. At the most basic level, CE is "reduce, reuse, recycle", the R-actions, in ranked order. CE of a PV technology can be metricized in a variety of ways, such as the Material Circularity Indicator (Smith and Jones, Ellen MacArthur Foundation, 2019) or recycling rates. Unfortunately, standard CE metrics have several shortcomings for measuring renewable energy technologies in the context of deployment for energy transition (Figge 2018, Saidani 2019): 1) Only measure mass flows; 2) De-prioritization of the use phase in favor of mass circularity when scoring; and 3) Tight focus on a single product scale The use phase and energy flows of PV are key to energy transition, and therefore need to be quantified. Additionally, correlating product-scale to system-scale is necessary for quantifying the environmental impacts of energy transition. Life Cycle Assessment (LCA) can address some of these concerns, but also focuses on a single product scale and has trouble capturing the dynamics of system-scale energy transition, such as the interaction of module lifetime with manufacturing demands for energy transition deployment schedules. Therefore, we developed an open-source Python-based system dynamics model to quantify the mass, energy and carbon impacts of CE R-actions for PV technologies in the energy transition; PV in the CE (PV ICE) (Ovaitt & Mirletz 2021). The tool captures supply chains from material extraction through end of life, incorporating 5 circular end of life pathways. PV ICE takes in any evolving bill of materials, module properties and deployment schedule to support researchers and decision makers with data-backed insights. In this work, we quantify and compare proposed CE sustainable PV module designs and lifecycle management strategies, spanning currently commercialized technologies, government and industry technology targets, and several low Technology Readiness Level (TRL) emerging PV technologies, including perovskites. Our analyses capture the projected evolutions of lifetime, efficiency and material circularity of these PV technologies, as well as their material supply chains. Our analyses emphasize the importance of examining a suite of metrics to identify priorities and tradeoffs, and inform design or lifecycle management decisions holistically. Previous analyses have demonstrated the central importance of PV module lifetime to support energy transition while minimizing impacts. High levels of material circularity (>90%) enable minimizing lifecycle wastes, can reduce virgin material demands if paired with improving efficiency, but demonstrate tradeoffs in energy return on investment. In the fervor of new material and technology development, it is important to remember that CE is not the end goal; decarbonization and energy transition are the end goal. CE should be used in service to improve the sustainability of PV, and R-actions evaluated for their usefulness and efficacy to this end.

carbon↗

MARS: Malleable Actor-Critic Reinforcement Learning Scheduler

In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.

Baheri, Betis↗

Predictive Scheduling for Electric Vehicles Considering Uncertainty of Load and User Behaviors

Un-coordinated Electric Vehicle (EV) charging can create unexpected load in local distribution grid, which may degrade the power quality and system reliability. The uncertainty of EV load, user behaviors and other baseload in distribution grid, is one of challenges that impedes optimal control for EV charging problem. Previous researches did not fully solve this problem due to lack of real-world EV charging data and proper stochastic model to describe these behaviors. In this paper, we propose a new predictive EV scheduling algorithm (PESA) inspired by Model Predictive Control (MPC), which includes a dynamic load estimation module and a predictive optimization module. The user-related EV load and base load are dynamically estimated based on the historical data. At each time interval, the predictive optimization program will be computed for optimal schedules given the estimated parameters. Only the first element from the algorithm outputs will be implemented according to MPC paradigm. Current-multiplexing function in each Electric Vehicle Supply Equipment (EVSE) is considered and accordingly a virtual load is modeled to handle the uncertainties of future EV energy demands. This system is validated by the real-world EV charging data collected on UCLA campus and the experimental results indicate that our proposed model not only reduces load variation up to 40% but also maintains a high level of robustness. Finally, IEC 61850 standard is utilized to standardize the data models involved, which brings significance to more reliable and large-scale implementation.

Wang, Bin↗

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.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

Scheduling Multiple Agents in a Persistent Monitoring Task Using Reachability Analysis

We consider the problem of controlling the dynamic state of each of a finite collection of targets distributed in physical space using a much smaller collection of mobile agents. Each agent can attend to no more than one target at a given time, thus agents must move between targets to control the collective state, implying that the states of each of the individual targets are only controlled intermittently. We assume that the state dynamics of each of the targets are given by a linear, time-invariant, controllable system, and develop conditions on the visiting schedules of the agents to ensure that the property of controllability is maintained in the face of the intermittent control. We then introduce constraints on the magnitude of the control input and a bounded disturbance into the target dynamics and develop a method to evaluate system performance under this scenario. Finally, we use this method to determine how the amount of time the agents spend at a given target, before switching to the next in its sequence, influences the control of the states of the entire collection of targets.

42 ENGINEERING↗

NETL to establish Dynamic Simulation Research and Training Center to promote IGCC technology with CO2 cpture

To meet increasing demand for education and experience with commercial-scale, coal-fired, integrated gasification combined cycle (IGCC) plants with CO2 capture, the Department of Energy’s (DOE) National Energy Technology Laboratory (NETL) is leading a project to deploy a generic, full-scope, real-time IGCC dynamic plant simulator for use in establishing a world-class research and training center, and to promote and demonstrate IGCC technology to power industry personnel. The simulator, being built by Invensys Process Systems (IPS), will be installed at two separate sites, at NETL and West Virginia University (WVU), and will combine a process/gasification simulator with a power/combined-cycle simulator together in a single dynamic simulation framework for use in engineering research studies and training applications. The simulator, scheduled to be launched in mid-year 2010, will have the following capabilities: High-fidelity, dynamic model of process-side (gasification and gas cleaning with CO2 capture) and power-block-side (combined cycle) for a generic IGCC plant fueled by coal and/or petroleum coke. Highly flexible configuration that allows concurrent training on separate gasification and combined cycle simulators, or up to two IGCC simulators. Ability to enhance and modify the plant model to facilitate studies of changes in plant configuration, equipment, and control strategies to support future R&D efforts. Training capabilities including startup, shutdown, load following and shedding, response to fuel and ambient condition variations, control strategy analysis (turbine vs. gasifier lead, etc.), representative malfunctions/trips, alarms, scenarios, trending, snapshots, data historian, etc. To support this effort, process descriptions and control strategies were developed for key sections of the plant as part of the detailed functional specification, which is serving as the basis of the simulator development. In this paper, we highlight the contents of the detailed functional specification for the simulator. We also describe the engineering, design, and expert testing process that the simulator will undergo in order to ensure that maximum fidelity is built into the generic simulator. Future applications and training programs associated with gasification, combined cycle, and IGCC simulations are discussed, including plant operation and control demonstrations, as well as education and training services.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗