93 search results - page 3 / 19 » Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm |
ECRTS
2009
IEEE
13 years 3 months ago
2009
IEEE
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept o...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
RTSS
2009
IEEE
14 years 1 days ago
2009
IEEE
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
RTSS
1997
IEEE
13 years 9 months ago
1997
IEEE
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...