Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 期刊論文 > Item 987654321/96128

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/96128

题名:	Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
作者:	Lu, Wan-Chen;Lin, Kwei-Jay;Wei, Hsin-Wen;Shih, Wei-Kuan
贡献者:	淡江大學電機工程學系
关键词:	Real-time systems;periodic tasks;fixed-priority preemptive scheduling;schedulability analysis
日期:	2008-05
上传时间:	2014-03-03 16:31:26 (UTC+8)
摘要:	Real-time systems using rate-monotonic fixed priority scheduling can be checked for schedulability either by sufficient but pessimistic schedulability conditions or by exact testing. Exact testing provides a more precise result but may not be performed in polynomial time. Audsley et al. proposed one of the earliest methods by iteratively deriving the response times of jobs. Other researchers have improved the exact test method by using different initial values for testing. In this paper, we propose new initial values of p, - p, , and f in a task set of i tasks, where p, is the period of task Tl. We show that the new initial values can significantly improve the efficiency of exact testing. These period-dependent initial values can also be used for the schedulability test of multiframe task models and effectively reduce the number of iterations for testing.
關聯:	IEEE Transactions on Computers 57(5), pp.648-659
DOI:	10.1109/TC.2007.70820
显示于类别:	[電機工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	301	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章