506 search results - page 2 / 102 » State-Dependent Deadline Scheduling |
RTAS
2011
IEEE
12 years 8 months ago
2011
IEEE
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
BROADNETS
2004
IEEE
13 years 9 months ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
RTSS
2003
IEEE
13 years 10 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
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...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...