This Article 
 Bibliographic References 
 Add to: 
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
June 1999 (vol. 10 no. 6)
pp. 549-559

Abstract—Tasks in a real-time control application are usually periodic and they have deadline constraints by which each instance of a task is expected to complete its computation, even in the adverse circumstances caused by component failures. Techniques to recover from processor failures often involve a reconfiguration in which all tasks are assigned to fault-free processors. This reconfiguration may result in processor overload where it is no longer possible to meet the deadlines of all tasks. In this paper, we discuss an overload management technique which discards selected task instances in such a way that the performance of the control loops in the system remain satisfactory even after a failure. The technique is based on the rationale that real-time control applications can tolerate occasional misses of the control law updates, especially if the control law is modified to account for these missed updates. The paper devises a scheduling policy which deterministically guarantees when and where the misses will occur. The paper also proposes a methodology for modifying the control law to minimize the deterioration in the control system behavior as a result of these missed control law updates.

[1] H. Chetto and M. Chetto, “Some Results of the Earliest Deadline Scheduling Algorithm,” IEEE Trans. Software Eng., vol. 15, no. 10, pp. 1,261-1,269, Oct. 1989.
[2] 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.
[3] 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.
[4] B. Sprunt, L. Sha, and J. Lehoczky, “Aperiodic Task Scheduling for Hard Real-Time Systems,” Real-Time Systems, vol. 1, pp. 27–60, June 1989.
[5] J. Xu and D.L. Parnas, “Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations,” IEEE Trans. Software Eng., vol. 16, no. 3, pp. 360-369, Mar. 1990.
[6] K. Jeffay, D.F. Stanat, and C.U. Martel, “On Non-Preemptive Scheduling of Periodic and Sporadic Tasks,” Proc. Real-Time Systems Symp., pp. 129-139, 1991.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] K. Ramamritham, “Allocation and Scheduling of Complex Periodic Tasks,” Proc. 10th IEEE Int'l Conf. Distributed Computing Systems, 1990.
[9] W. Zhao, K. Ramamritham, and J.A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 13, no. 5, pp. 564-577, May 1987.
[10] Fault-Tolerant Computer System Design, D.K. Pradhan, ed. Prentice Hall, 1996.
[11] R.M. Kieckhafer,C.J. Walter,A.M. Finn, and P.M. Thambidurai,"The MAFT Architecture for Distributed Fault-Tolerance," IEEE Trans. Computers, vol. 37, no. 4, pp. 398-405, Apr. 1988.
[12] A.L. Hopkins, T.B. Smith, and J.H. Lala, “FTMP—A Highly Reliable Fault-Tolerant Multiprocessor for Aircraft,” Proc. IEEE, vol. 66, Oct. 1978.
[13] M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Computers, vol. 44, no. 12, pp. 1,443-1,451, Dec. 1995.
[14] G.F. Franklin, J.D. Powell, and M.L. Workman, Digital Control of Dynamic Systems, second ed. Addison-Wesley, 1990.
[15] J.Y. Chung,J.W.S. Liu,, and K.J. Lin,“Scheduling Periodic Jobs That Allows Imprecise Results,” IEEE Transactions on Computers, vol.19, no. 9, pp. 1156-1173, September 1990.
[16] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[17] G. Koren and D. Shasha, "Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips," Proc. IEEE Real-Time System Symp., pp. 110-117,Pisa, Italy, Dec. 1995.
[18] G. Bernat and A. Burns, "Combining (n, m)-Hard Deadlines and Dual Priority Scheduling," Proc. IEEE Real-Time Systems Symp.,San Francisco, pp. 46-57, Dec. 1997.
[19] M. Caccamo and G.C. Buttazzo, "Exploiting Skips In Periodic Tasks For Enhancing Aperiodic Responsiveness," Proc. IEEE Real-Time Systems Symp., pp. 330-339,San Francisco, Dec. 1997.
[20] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[21] T. Mita, “Optimal Digital Feedback Control Systems Counting Computation Time of Control Laws,” IEEE Trans. Automatic Control, vol. 30, pp. 542–548, June 1985.
[22] S. Bittanti, P. Colaneri, and D. DeNicolao, “The Periodic Riccati Equation,” The Riccati Equation, S. Bittanti, A.J. Laub, and J.C. Willems, eds., chapter 6, pp. 127–162. Springer-Verlag, 1991.

Index Terms:
Real-time systems, fault-tolerant controllers, real-time scheduling, overload management, optimal feedback control.
Parameswaran Ramanathan, "Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 6, pp. 549-559, June 1999, doi:10.1109/71.774906
Usage of this product signifies your acceptance of the Terms of Use.