Add to ORKGIn this paper we present a low-cost Slack-Stealing method, named Fast Slack, to be employed in a Fixed Priority scheduling mechanism. The slack obtained is intended to improve the execution of non-critical tasks without jeopardizing the schedulability of the critical ones. The method is compared with the most important one in the real-time theory. We show that the complexity of this method is suitable to be implemented online in embedded real-time systems. Besides, we can determine online the amount of time that the calculus of the slack will take. Key Words: Slack Stealing, Embedded Systems, Real-Time Scheduling
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-tim...
A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each peri...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
International audienceWe propose to handle execution duration overruns (temporal faults) in real-tim...
This article presents and evaluates the Slack Method, a new constructive heuristic for the allocatio...
This work presents a novel slack management technique, the Service Rate Based Slack Distribution Tec...
The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has bee...
Scheduling a sequence of jobs released over time when the processing time of a job is only known at ...
Real-time systems like pervasive computing have to complete executing a task within the predetermine...
Power aware computing has become popular recently and many techniques have been pro-posed to manage ...
International audienceScheduling tasks is one of the most challenging problems in real-time systems....
Computers across all domains increasingly rely on multiple processors/cores, with processors startin...
It is well known that on-line preemptive scheduling algorithms can achieve efficient performance, A ...
International audienceThe aim of our work is to provide a mechanism to deal with soft real-time aper...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-tim...
A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each peri...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
International audienceWe propose to handle execution duration overruns (temporal faults) in real-tim...
This article presents and evaluates the Slack Method, a new constructive heuristic for the allocatio...
This work presents a novel slack management technique, the Service Rate Based Slack Distribution Tec...
The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has bee...
Scheduling a sequence of jobs released over time when the processing time of a job is only known at ...
Real-time systems like pervasive computing have to complete executing a task within the predetermine...
Power aware computing has become popular recently and many techniques have been pro-posed to manage ...
International audienceScheduling tasks is one of the most challenging problems in real-time systems....
Computers across all domains increasingly rely on multiple processors/cores, with processors startin...
It is well known that on-line preemptive scheduling algorithms can achieve efficient performance, A ...
International audienceThe aim of our work is to provide a mechanism to deal with soft real-time aper...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-tim...
A real-time system typically has a mixture of periodic and aperiodic workload. Requests in each peri...