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

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/96128

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/96128

Title:	Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
Authors:	Lu, Wan-Chen;Lin, Kwei-Jay;Wei, Hsin-Wen;Shih, Wei-Kuan
Contributors:	淡江大學電機工程學系
Keywords:	Real-time systems;periodic tasks;fixed-priority preemptive scheduling;schedulability analysis
Date:	2008-05
Issue Date:	2014-03-03 16:31:26 (UTC+8)
Abstract:	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.
Relation:	IEEE Transactions on Computers 57(5), pp.648-659
DOI:	10.1109/TC.2007.70820
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	303	View/Open