Sciweavers

Share
VLSID
2006
IEEE

Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems

9 years 4 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 multiprocessor environment with O(1) scheduling overhead. FBFMS meets these seemingly contradictory goals by applying the benefits of Virtual Time Round − Robin scheduling mechanism along with a frame based scheduling approach. Simulation results show that the algorithm provides 2.5 to 26 times speedup (over O(lg n) complexity schedulers) with distortion in fairness less than 1% in most cases, and less than 15% in the worst case.
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where VLSID
Authors Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
Comments (0)
books