402 search results - page 11 / 81 » Gang EDF Scheduling of Parallel Task Systems |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
ADAEUROPE
2005
Springer
14 years 1 months ago
2005
Springer
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...
ECRTS
1999
IEEE
14 years 14 hour ago
1999
IEEE
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing th...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
ETFA
2006
IEEE
13 years 11 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...