Sciweavers

157 search results - page 1 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
13 years 10 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
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...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
IPPS
2003
IEEE
13 years 10 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...
ECRTS
2000
IEEE
13 years 9 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
OSDI
2000
ACM
13 years 6 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
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...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
ICPADS
2006
IEEE
13 years 10 months ago
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
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...
Aaron Block, James H. Anderson