This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
May 2008 (vol. 57 no. 5)
pp. 648-659
ASCII Text
x 
 
Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih, "Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values," IEEE Transactions on Computers, vol. 57, no. 5, pp. 648-659, May, 2008.
 
 
BibTex
x
 
@article{ 10.1109/TC.2007.70820,
author = {Wan-Chen Lu and Kwei-Jay Lin and Hsin-Wen Wei and Wei-Kuan Shih},
title = {Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values},
journal ={IEEE Transactions on Computers},
volume = {57},
number = {5},
issn = {0018-9340},
year = {2008},
pages = {648-659},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70820},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
IS - 5
SN - 0018-9340
SP648
EP659
EPD - 648-659
A1 - Wan-Chen Lu,
A1 - Kwei-Jay Lin,
A1 - Hsin-Wen Wei,
A1 - Wei-Kuan Shih,
PY - 2008
KW - Real-time systems
KW - Scheduling
KW - Model Validation and Analysis
VL - 57
JA - IEEE Transactions on Computers
ER -
 
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing provides a more precise result but cannot always be performed in polynomial time. Audsley et al. proposed one of the earliest methods by iteratively deriving the job response times. Other researchers have improved the efficiency of the exact test method by using different initial values. None of those proposed initial values uses the relationship between task periods. In this paper we define initial values using the largest and the second largest periods in a task set. We show that the new initial values can significantly reduce the efficiency of the exact test. This period-dependent initial values can also be applied to the schedulability test of multiframe task models and effectively reduce the number of iterations for testing.

[1] N.C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, “Applying New Scheduling Theory to Static Priority Preemptive Scheduling,” Software Eng. J., vol. 8, no. 5, pp. 284-292, 1993.
[2] E. Bini and G.C. Buttazzo, “The Space of Rate Monotonic Schedulability,” Proc. 23rd IEEE Int'l Real-Time Systems Symp., pp. 169-178, 2002.
[3] R.J. Bril, W.F.J. Verhaegh, and E.J.D. Pol, “Initial Values for On-line Response Time Calculations,” Proc. 15th Euromicro Conf. Real-Time Systems, pp. 13-22, 2003.
[4] C.C. Han, “A Better Polynomial-Time Schedulability Test for Real-Time Multiframe Tasks,” Proc. 19th IEEE Int'l Real-Time Systems Symp., pp. 104-113, 1998.
[5] N.I. Kamenoff and N.H. Weiderman, “Hartstone Distributed Benchmark: Requirements and Definitions,” Proc. 12th IEEE Int'l Real-Time Systems Symp., pp. 199-208, 1991.
[6] N. Kim, M. Ryu, S. Hong, M. Saksena, C.H. Choi, and H. Shin, “Visual Assessment of a Real-Time System Design: A Case Study on a CNC Controller,” Proc. 17th IEEE Int'l Real-Time Systems Symp., pp. 300-310, 1996.
[7] T.W. Kuo, L.P. Chang, Y.H. Liu, and K.J. Lin, “Efficient On-Line Schedulability Tests for Real-Time Systems,” IEEE Trans. Software Eng., vol. 29, no. 8, pp. 734-751, Aug. 2003.
[8] S. Lauzac, R. Melhem, and D. Mossé, “An Improved Rate-Monotonic Admission Control and Its Applications,” IEEE Trans. Computers, vol. 52, no. 3, pp. 337-350, Mar. 2003.
[9] J. Lehoczky, L. Sha, and Y. Ding, “The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Behavior,” Proc. 10th IEEE Int'l Real-Time Systems Symp., pp. 166-171, 1989.
[10] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[11] J.W.S. Liu, Real-Time Systems. Prentice Hall, 2000.
[12] C.D. Locke, D.R. Vogel, and T.J. Mesler, “Building a Predictable Avionics Platform in Ada: A Case Study,” Proc. 12th IEEE Int'l Real-Time Systems Symp., pp. 181-189, 1991.
[13] W.C. Lu, J.W. Hsieh, W.K. Shih, and T.W. Kuo, “A Faster Exact Schedulability Analysis for Fixed-Priority Scheduling,” J. Systems and Software, vol. 79, no. 12, pp. 1744-1753, 2006.
[14] W.C. Lu, K.J. Lin, H.W. Wei, and W.K. Shih, “New Schedulability Conditions for Real-Time Multiframe Tasks,” Proc. 19th Euromicro Conf. Real-Time Systems, pp. 39-48, 2007.
[15] W.C. Lu, H.W. Wei, and K.J. Lin, “Rate Monotonic Schedulability Conditions Using Relative Period Ratios,” Proc. 12th IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, pp. 3-9, 2006.
[16] A.K. Mok and D. Chen, “A Multiframe Model for Real-Time Tasks,” IEEE Trans. Software Eng., vol. 23, no. 10, pp. 635-645, Oct. 1997.
[17] J.J. Molini, S.K. Maimon, and P.H. Watson, “Real-Time System Scenarios,” Proc. 12th IEEE Int'l Real-Time Systems Symp., pp. 214-225, 1991.

Index Terms:
Real-time systems, Scheduling, Model Validation and Analysis
Citation:
Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih, "Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values," IEEE Transactions on Computers, vol. 57, no. 5, pp. 648-659, May 2008, doi:10.1109/TC.2007.70820
Usage of this product signifies your acceptance of the Terms of Use.