Sciweavers

17 search results - page 1 / 4
» Group-Based Pfair Scheduling
Sort
View
RTS
2006
121views more  RTS 2006»
13 years 10 months ago
Group-Based Pfair Scheduling
We consider 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...
Philip Holman, James H. Anderson
ECRTS
2000
IEEE
14 years 2 months ago
Early-release fair scheduling
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...
James H. Anderson, Anand Srinivasan
IPPS
2005
IEEE
14 years 4 months ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
UmaMaheswari C. Devi, James H. Anderson
IPPS
2003
IEEE
14 years 3 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
RTSS
2002
IEEE
14 years 3 months ago
Locking in Pfair-Scheduled Multiprocessor Systems
We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The...
Philip Holman, James H. Anderson