2274 search results - page 27 / 455 » Real-Time Scheduling in Distributed Systems |
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
DAC
1997
ACM
15 years 1 months ago
1997
ACM
Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be f...
108
click to vote
TPDS
1998
14 years 9 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
ETFA
2006
IEEE
15 years 1 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...
100
Voted
CORR
2010
Springer
14 years 7 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...