UM  > 科技學院  > 電腦及資訊科學系
Rate monotonic scheduling re-analysed
Xu Q.2; Zhan N.1
Source PublicationInformation Processing Letters

In this paper, we re-analyse the rate monotonic scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all the task sets that (are schedulable and) fully utilise the processor. We argue that full utilisation is not very appropriate for this purpose. We re-establish Liu and Layland's classic schedulability theorem by finding the greatest lower bound of utilisation factors over all the unschedulable task sets instead. The merits of our approach include: Firstly, the fact that the bound is both sound and tight for schedulability follows directly from definition; Secondly, our proof is simpler technically. © 2009.

KeywordReal Time Systems Schedulability Conditions Scheduling
URLView the original
Indexed BySCI
WOS Research AreaComputer Science
WOS SubjectComputer Science, Information Systems
WOS IDWOS:000275071900006
Fulltext Access
Citation statistics
Document TypeJournal article
Affiliation1.Institute of Software Chinese Academy of Sciences
2.Universidade de Macau
Recommended Citation
GB/T 7714
Xu Q.,Zhan N.. Rate monotonic scheduling re-analysed[J]. Information Processing Letters,2010,110(6):226-231.
APA Xu Q.,&Zhan N..(2010).Rate monotonic scheduling re-analysed.Information Processing Letters,110(6),226-231.
MLA Xu Q.,et al."Rate monotonic scheduling re-analysed".Information Processing Letters 110.6(2010):226-231.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xu Q.]'s Articles
[Zhan N.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xu Q.]'s Articles
[Zhan N.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xu Q.]'s Articles
[Zhan N.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.