15 search results - page 2 / 3 » Desynchronized Pfair Scheduling on Multiprocessors |
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 ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is als...
RTSS
2006
IEEE
13 years 10 months ago
2006
IEEE
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
RTSS
2006
IEEE
13 years 10 months ago
2006
IEEE
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...
ECRTS
2003
IEEE
13 years 10 months ago
2003
IEEE
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...