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.

• Type: Conference
• Year: 2006
• Where: VLSID
• Authors: Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
• Keywords: Computer Architecture, Fair Multiprocessor Scheduler, Proportional Fair Scheduling, Robin Scheduling Mechanism, VLSID 2006