15 search results - page 3 / 3 » Flexible tardiness bounds for sporadic real-time task system... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
OPODIS
2010
13 years 2 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
ESA
2008
Springer
13 years 6 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...
RTS
2008
13 years 4 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
ECRTS
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...