DocumentCode :
3095632
Title :
Frame based fair multiprocessor scheduler: a fast fair algorithm for real-time embedded systems
Author :
Sarkar, Arnab ; Chakrabarti, P.P. ; Kumar, Rajeev
Author_Institution :
Indian Inst. of Technol., Kharagpur, India
fYear :
2006
fDate :
3-7 Jan. 2006
Abstract :
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.
Keywords :
computational complexity; embedded systems; multiprocessing systems; processor scheduling; dynamic tasks; fast fair algorithm; frame based fair multiprocessor scheduler; real-time embedded systems; scheduling overhead; symmetric multiprocessor environment; virtual time round-robin scheduling mechanism; Dynamic scheduling; Electronic mail; Embedded system; Processor scheduling; Quality of service; Real time systems; Resource management; Scheduling algorithm; Streaming media; Teleconferencing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI Design, 2006. Held jointly with 5th International Conference on Embedded Systems and Design., 19th International Conference on
ISSN :
1063-9667
Print_ISBN :
0-7695-2502-4
Type :
conf
DOI :
10.1109/VLSID.2006.90
Filename :
1581534
Link To Document :
بازگشت