904 search results - page 8 / 181 » Scheduling task graphs optimally with A |
IPPS
1998
IEEE
14 years 25 days 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 10 months ago
2008
Springer
ECRTS
2006
IEEE
14 years 2 months ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
CJ
1999
13 years 8 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...