157 search results - page 1 / 32 » The Case for Fair Multiprocessor Scheduling |
102
click to vote
VLSID
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
IPPS
2003
IEEE
15 years 4 months ago
2003
IEEE
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...
ECRTS
2000
IEEE
15 years 3 months ago
2000
IEEE
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 ...
OSDI
2000
ACM
2000
ACM
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
15 years 2 days ago
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
ICPADS
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...