373 search results - page 3 / 75 » Scheduling Conditional Task Graphs |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
EMSOFT
2008
Springer
13 years 7 months ago
2008
Springer
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
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...
EUROPAR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...