149 search results - page 4 / 30 » Optimal Scheduling of Contract Algorithms with Soft Deadline... |
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
RTSS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
RTSS
1997
IEEE
15 years 1 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...
ISLPED
2007
ACM
14 years 11 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...