This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Rate-Monotonic Admission Control and Its Applications
March 2003 (vol. 52 no. 3)
pp. 337-350
Daniel Mossé, IEEE Computer Society

Abstract—Rate-monotonic scheduling (RMS) is a widely used real-time scheduling technique. This paper proposes RBound, a new admission control for RMS. RBound has two interesting properties. First, it achieves high processor utilization under certain conditions. We show how to obtain these conditions in a multiprocessor environment and propose a multiprocessor scheduling algorithm that achieves a near optimal processor utilization. Second, the framework developed for RBound remains close to the original RMS framework (that is, task dispatching is still done via a fixed-priority scheme based on the task periods). In particular, we show how RBound can be used to guarantee a timely recovery in the presence of faults and still achieve high processor utilization. We also show how RBound can be used to increase the processor utilization when aperiodic tasks are serviced by a priority exchange server or a deferrable server.

[1] A. Bertossi, A. Fusiello, and L. Mancini, “Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks,” Proc. Int'l Parallel Processing Symp., pp. 133-138, 1997.
[2] A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, “Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995.
[3] A. Burns, R. Davis, and S. Punnekkat, “Feasibility Analysis of Fault-Tolerant Real-Time Task Sets,” Proc. Euromicro Workshop Real-Time Systems, pp. 29-33, 1996.
[4] S. Davari and S.K. Dhall, “An On Line Algorithm for Real-Time Tasks Allocation,” Proc. IEEE Real-Time Systems Symp., pp. 194-200, 1986.
[5] S. Davari and S.K. Dhall, “On a Periodic Real-Time Task Allocation Problem” Proc. 19th Ann. Int'l Conf. System Sciences, pp. 133-141, 1986.
[6] S.K. Dhall and C.L. Liu, “On a Real-Time Scheduling Problem,” Operations Research, vol. 26, no. 1, pp. 127-140, 1978.
[7] S. Ghosh, R. Melhem, and D. Mossé, “Analysis of a Fault-Tolerant Multiprocessor Scheduling Algorithm,” Proc. Fault Tolerant Computing Symp., 1994.
[8] S. Ghosh, D. Mossé, and R. Melhem, Tolerant Rate-Monotonic Scheduling J. Real-Time Systems, vol. 15, no. 2, Sept. 1998.
[9] C.-C. Han, H.y. Tyan, “A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms,” Proc. IEEE Real-Time Systems Symp., pp. 36-45, Dec. 1997.
[10] K.-H. Huang and J.A. Abraham, “Algorithm-Based Fault Tolerance for Matrix Operations,” IEEE Trans. Computers, vol. 33, pp. 518-528, 1984.
[11] M. Joseph and P. Pandya, “Finding Response Times in a Real-Time System,” The Computer J., vol. 29, no. 5, pp. 390-395, 1986.
[12] S. Lauzac, R. Melhem, and D. Mossé, “Comparison of Global and Partitioning Schemes for Scheduling Rate Monotonic Tasks on a Multiprocessor,” Proc. Euromicro Workshop Real-Time Systems, pp. 188-195, 1998.
[13] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[14] J. Lehoczky, L. Sha, and J.K. Strosnider, “Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” Proc. IEEE Real-Time Systems Symp., pp. 261-270, 1987.
[15] J.Y.-T. Leung and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks,” Performance Evaluation, vol. 2, pp. 237-250, 1982.
[16] 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.
[17] Y. Oh and S. Son, “An Algorithm for Real-Time Fault-Tolerant Scheduling in a Multiprocessor System,” Proc. Fourth Euromicro Workshop Real-Time Systems, June 1992.
[18] Y. Oh and S.H. Son,“Tight performance bounds of heuristics for a real-time scheduling problem,” Technical Report CS-93-24, Univ. of Virginia, Dept. of Computer Science, May 1993.
[19] Y. Oh and S.H. Son, Enhancing Fault-Tolerance in Rate-Monotonic Scheduling J. Real-Time Systems, vol. 7, no. 3, pp. 315-329, Nov. 1994.
[20] M. Pandya and M. Malek, “Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks,” IEEE Trans. Computers, vol. 47, no. 10, pp. 1102-1112, Oct. 1998.
[21] S. Ramos-Thuel and J.K. Strosnider, “Scheduling Fault Recovery Operations for Time-Critical Applications,” Proc. Fourth IFIP Conf. Dependable Computing for Critical Applications, Jan. 1995.
[22] K.G. Shin and P. Ramanathan, "Real-Time Computing: A New Discipline of Computer Science and Engineering," Proc. IEEE, vol. 82, no. 1, Jan. 1994.
[23] J.A. Stankovic, “Decentralized Decision Making for Tasks Reallocation in a Hard Real-Time System,” IEEE Trans. Computers, vol. 38, no. 3, pp. 341-355, Mar. 1989.
[24] J.K. Strosnider, J.P. Lehoczky, and L. Sha, “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” IEEE Trans. Computers, vol. 44, no. 1, Jan. 1995.
[25] Y.M. Yeh and T.Y. Feng, “Algorithm Based Fault Tolerance for Matrix Inversion with Maximum Pivoting,” J. Parallel and Distributed Computing, vol. 14, pp. 373-389, 1992.

Index Terms:
Real-time, scheduling, rate monotonic, operating systems.
Citation:
Sylvain Lauzac, Rami Melhem, Daniel Mossé, "An Improved Rate-Monotonic Admission Control and Its Applications," IEEE Transactions on Computers, vol. 52, no. 3, pp. 337-350, March 2003, doi:10.1109/TC.2003.1183948
Usage of this product signifies your acceptance of the Terms of Use.