rate monotonic scheduling re-analysed
文献类型：期刊论文
| 作者 | Xu Qiwen ; Zhan Naijun |
| 刊名 | INFORMATION PROCESSING LETTERS
 |
| 出版日期 | 2010 |
| 卷号 | 110期号:6页码:226-231 |
| 关键词 | Real time systems Scheduling Schedulability conditions |
| ISSN号 | 0020-0190 |
| 学科主题 | Computer Science ; Information Systems |
| WOS记录号 | WOS:000275071900006 |
| 公开日期 | 2011-05-23 |
| 附注 | 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 Laylands 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. (C) 2009 Published by Elsevier B.V. |
| 源URL | [http://124.16.136.157/handle/311060/9776]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _期刊论文 |
| 推荐引用方式 GB/T 7714 | Xu Qiwen,Zhan Naijun. rate monotonic scheduling re-analysed[J]. INFORMATION PROCESSING LETTERS,2010,110(6):226-231. |
| APA | Xu Qiwen,&Zhan Naijun.(2010).rate monotonic scheduling re-analysed.INFORMATION PROCESSING LETTERS,110(6),226-231. |
| MLA | Xu Qiwen,et al."rate monotonic scheduling re-analysed".INFORMATION PROCESSING LETTERS 110.6(2010):226-231. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。