Name
Abstract | ||
|---|---|---|
In this paper we propose a novel scheduling framework for a real-time environment that experiences dynamic changes. This framework is capable of adjusting the system workload in incremental steps under overloaded conditions such that the most critical tasks in the system are always scheduled and the total value of the system is maximized. Each task has an assigned criticality value and consists of two parts, a mandatory part and an optional part. A timely answer is available after the mandatory part completes execution and its value may be improved by executing the entire optional part. Optional parts can be discarded in overloaded conditions. The process of selecting optional parts to discard while maximizing the value of the system requires the exploration of a potentially large number of combinations. Since this process is too time consuming to be computed on-line, an approximate algorithm is executed incrementally whenever the processor would otherwise be idle, progressively refining the quality of the solution. This criteria allows the scheduler to handle overloads with low cost while maximizing the use of the available resources and without jeopardizing the temporal constraints of the most critical tasks in the system. Simulation results show that few stages of the algorithm need to be executed for achieving a performance with near-optimal results. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/REAL.2000.896017 | Orlando, FL |
Keywords | Field | DocType |
optimisation,real-time systems,resource allocation,scheduling,approximate algorithm,critical tasks,dynamic changes,idle processor,incremental scheduling approach,mandatory part,optional part,overloaded conditions,performance,progressive solution quality refinement,real-time system overloads,resource utilization maximization,simulation,system total value maximization,system workload adjustment,task criticality,temporal constraints | Aerospace,Job shop scheduling,Workload,Computer science,Scheduling (computing),Idle,Real-time computing,Resource allocation,Criticality,Dynamic priority scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-7695-0900-2 | 19 |
PageRank | References | Authors |
1.75 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro Mejía-Alvarez | 1 | 460 | 35.81 |
| Rami Melhem | 2 | 2537 | 164.09 |
| Daniel Mossé | 3 | 2184 | 148.86 |