This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
October 1998 (vol. 47 no. 10)
pp. 1102-1112

Abstract—The Rate Monotonic Scheduling (RMS) policy is a widely accepted scheduling strategy for real-time systems due to strong theoretical foundations and features attractive to practical uses. For a periodic task set of n tasks with deadlines at the end of task periods, it guarantees a feasible schedule on a single processor as long as the utilization factor of the task set is below n(21/n$-$ 1) which converges to 0.69 for large n. We analyze the schedulability of a set of periodic tasks that is scheduled by the RMS policy and is susceptible to a single fault. The recovery action is the reexecution of all uncompleted tasks. The priority of the RMS policy is maintained even during recovery. Under these conditions, we guarantee that no task will miss a single deadline, even in the presence of a fault, if the utilization factor on the processor does not exceed 0.5. Thus, 0.5 is the minimum achievable utilization that permits recovery from faults before the expiration of the deadlines of the tasks. This bound is better than the trivial bound of 0.69/2 = 0.345 that would be obtained if computation times were doubled to provide for reexecutions in the RMS analysis. Our result provides scheduling guarantees for tolerating a variety of intermittent and transient hardware and software faults that can be handled simply by reexecution. In addition, we demonstrate how permanent faults can be tolerated efficiently by maintaining common spares among a set of processors that are independently executing periodic tasks.

[1] 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.
[2] 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.
[3] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. IEEE Real-Time Systems Symp., Dec. 1990.
[4] J. Lehoczky and L. Sha, "Performance of Real-Time Bus Scheduling Algorithms," ACM Performance Evaluation Review, special issue, vol. 14, May 1986.
[5] 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.
[6] S.K. Dhall and C.L. Liu, "On a Real-Time Scheduling Problem," Operations Research, vol. 26, no. 1, pp. 127-140, Jan./Feb. 1978.
[7] E.L. Lawler and C.U. Martel, "Scheduling Periodically Occurring Tasks on Multiple Processors," Information Processing Letters, vol. 12, no. 1, pp. 9-12, Feb.13 1981.
[8] J.Y.-T. Leung and M.L. Merril, "A Note on Preemptive Scheduling of Periodic, Real-Time Tasks," Information Processing Letters, vol. 11, no. 3, pp. 115-118, Nov.18 1980.
[9] J.Y.-T. Leung, "A New Algorithm for Scheduling Periodic, Real-Time Tasks," Algorithmica, vol. 4, pp. 209-219, 1989.
[10] M. Malek, "Responsive Systems: A Challenge for the Nineties," Keynote Address, EuroMicro '90, Microprocessing and Microprogramming, vol. 30, Aug. 1990.
[11] A. L. Liestman and R. H. Campbell,“A fault tolerant scheduling problem,”IEEE Trans. Software Eng., vol. SE-12, no. 11, pp. 1089–1095, Nov. 1986.
[12] C. M. Krishna and K. G. Shin,“On scheduling tasks with a quick recovery from failure,”IEEE Trans. Comput., vol. C-35, no. 5, pp. 448–455, May 1986.
[13] M. Takegaki, H. Kanamaru, and M. Fujita, "The Diffusion Model Based Task Remapping for Distributed Real-Time Systems," Proc. Real-Time Systems Symp., pp. 2-11, Dec. 1991.
[14] D.P. Siewiorek and R.S. Swarz, The Theory and Practice of Reliable System Design. Digital Press, 1982.
[15] M. Pandya, "Scheduling for Fault Tolerance and Real Time in Multicomputer Systems," doctoral dissertation, Dept. of Electrical and Computer Eng., Univ. of Texas at Austin, Aug. 1994.
[16] M. Pandya and M. Malek, "Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks," Technical Report TR 94-07, Dept. of Computer Sciences, Univ. of Texas at Austin, Mar. 1994.

Index Terms:
Fault tolerance, minimum achievable utilization, periodic tasks, rate monotonic scheduling, real-time systems.
Citation:
Mihir Pandya, Miroslaw Malek, "Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks," IEEE Transactions on Computers, vol. 47, no. 10, pp. 1102-1112, Oct. 1998, doi:10.1109/12.729793
Usage of this product signifies your acceptance of the Terms of Use.