DocumentCode :
3202320
Title :
Schedulability comparisons among periodic and distance-constrained real-time schedulers
Author :
Hsueh, Chih-Wen ; Lin, Kwei-Jay
Author_Institution :
Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA
fYear :
1997
fDate :
27-29 Oct 1997
Firstpage :
60
Lastpage :
66
Abstract :
Tasks in a real-time system must be scheduled to meet their timing constraints. In this paper, we discuss the schedulability relationship among two well-known schedulers EDF and RM, and a recently proposed scheduler Srb. We also compare the schedulability of Srb to other pinwheel schedulers Sx, Sr, and Sxb. Although EDF has the biggest schedulable task set than RM and Srb, the schedules produced by EDF are the most vulnerable to system overloads and with the least predictability. RM has a better predictability than EDF for tasks with a high priority but not for lower priority tasks. Since Srb schedules the tasks according to a set of transformed harmonic distance constraints, the produced schedule is very regular and provides the best predictability
Keywords :
processor scheduling; real-time systems; timing; distance-constrained real-time schedulers; pinwheel schedulers; real-time system; schedulability comparisons; timing constraints; transformed harmonic distance constraints; Aircraft; Algorithm design and analysis; Computer science; Contracts; Jitter; Processor scheduling; Real time systems; Scheduling algorithm; Strontium; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Computing Systems and Applications, 1997. Proceedings., Fourth International Workshop on
Conference_Location :
Taipei
Print_ISBN :
0-8186-8073-3
Type :
conf
DOI :
10.1109/RTCSA.1997.629174
Filename :
629174
Link To Document :
بازگشت