76 search results - page 2 / 16 » On Symbolic Scheduling Independent Tasks with Restricted Exe... |
RTCSA
2003
IEEE
13 years 10 months ago
2003
IEEE
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
ECRTS
2003
IEEE
13 years 10 months ago
2003
IEEE
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
ECRTS
2008
IEEE
13 years 11 months ago
2008
IEEE
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
ETFA
2006
IEEE
13 years 9 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...