DYNAMIC SCHEDULING
Dynamic scheduling of robotic mildew treatmentby UV-c in horticulture
... This paper proposes to resolve a dynamic scheduling problem with evolving task duration due to the evolution of the mildew level. A sim-optimization approach based on a genetic algorithm and a multi-agent ...
13
Dynamic Scheduling for sparse direct Solver on NUMA architectures
... Dynamic scheduling. Static and dynamic schedulers are compared in table 3, both use one thread dedicated to communications and NUMA allocation is en- ...the dynamic scheduler allows some ...
10
SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool
... We present Spawn, a physical interaction inspired scheduler that produces compact and optimal voronoi domains. In our case, Voronoi diagrams maximize per-core data locality, by providing numerous advantages: cache usage ...
10
SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool
... task scheduling algorithm as well as a mesh partitioning ...for dynamic scheduling while section 4 focuses on imple- mentation details and some preliminary ...and dynamic task schedulers ...
25
Analysis of Dynamic Scheduling Strategies for Matrix Multiplication on Heterogeneous Platforms
... 1. INTRODUCTION Recently, there has been a very important change in both parallel platforms and parallel applications. On the one hand, computing platforms, either clouds or supercomput- ers involve more and more ...
13
Dynamic Scheduling of Real-Time Tasks on Multicore Architectures
... energy-efficient scheduling for embedded many-core architecture with more general recurring task model which can be more appropriate for industrial purpose and to take into account the new trends, for example ...
3
A dynamic scheduling algorithm for time and resource-constrained task networks
... practical dynamic scheduling algorithm for time- and resource-constrained task networks, in which time constraints, resource constraints, exclusive constraints, and particularly the changing project ...
9
Dynamic scheduling of periodic skippable tasks in an overloaded real-time system
... handling dynamic workloads consisting of periodic firm deadline ...a dynamic test to accept or not a skippable task for execution, so as to lost minimum processing ...
10
Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks
... proposed scheduling algorithm, we started implementing it on a simulation tool called “YARTISS” [5], developed by a real-time team in the research lab- oratory of Universit ...own scheduling algorithm with ...
5
Task network-based project dynamic scheduling and schedule coordination
... the dynamic task network scheduling algorithm described in Section ...multi-project scheduling problem and we have developed a novel complete local search with memory approach for Facility ...
33
Dynamic Scheduling of MapReduce Shuffle under Bandwidth Constraints
... Figure 13: Variability of the time taken by all the 6 algorithms under various bandwidth restrictions with same amount of data and synchronous start of transfers.. Figure 12 shows the re[r] ...
39
EOLE: Combining Static and Dynamic Scheduling through Value Prediction to Reduce Complexity and Increase Performance
... Furthermore, since Value Prediction in itself usually increases performance, our resulting {Early — Out-of-Order — Late} Execution architecture, EOLE, is often more efficient than a base[r] ...
35
Dynamic fluid-based scheduling in a multi-class abandonment queue
... in service can abandon) and we have assumed that all customers contribute to the holding cost. The above described stochastic control problems have proved to be very difficult to solve. In [ 16 ] optimal dynamic ...
19
Dynamic DAG Scheduling Under Memory Constraints for Shared-Memory Platforms
... summary, dynamic scheduling is needed for performance, but one should ensure that any dynamic schedule that can be produced by the runtime sys- tem will never exceed the total amount of memory ...
30
Scheduling bi-colored chains
... Observations show that some HPC applications periodically alternate between (i) operations (computations, local data-accesses) executed on the compute nodes, and (ii) I/O transfers of data and this behavior can be ...
21
Revisiting Symbiotic Job Scheduling
... of scheduling independent sequential jobs on heterogeneous mul- tiprocessors ...of scheduling for heterogeneous mul- tiprocessors has resurfaced in the multicore era with heteroge- neous .... ...
12
Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms
... develop scheduling strategies that rely upon a coarse representation of the task graph instead of the complete graph, thereby allowing to deal with very large graphs while (hopefully) keeping a tight estimation of ...
11
Non-clairvoyant Scheduling Games
... on any machine k. A policy is strongly local if it looks only at the processing time of jobs in S j on machine j. We call a policy non-clairvoyant if the scheduling of jobs on machine j does not depend on the ...
22
Scheduling on power-heterogeneous processors
... power-heterogeneous processors are considered some structural properties of the optimal schedules of the homogeneous case are no longer valid. For instance, in the heterogeneous setting, in any optimal schedule, the ...
20
A dynamic critical path computation algorithm for enterprise process cooperative scheduling
... to Dynamic Programming [18], we divide all the activities into different phases to get some process parts under some single ...a dynamic environment in order to solve the problem according to the different ...
8