This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Handling Execution Overruns in Hard Real-Time Control Systems
July 2002 (vol. 51 no. 7)
pp. 835-849

In many real-time control applications, the task periods are typically fixed and worst-case execution times are used in schedulability analysis. With the advancement of robotics, flexible visual sensing using cameras has become a popular alternative to the use of embedded sensors. Unfortunately, the execution time of visual tracking varies greatly. In such environments, control tasks have a normally short computation time, but also an occasional long computation time; therefore, the use of worst-case execution time is inefficient for control performance optimization. Nevertheless, to maintain the control stability, we still need to guarantee the schedulability of the task set, even if the worst case arises. In this paper, we propose an integrated approach to control performance optimization and task scheduling for control applications where the execution time of each task can vary greatly. We present an innovative approach to overrun management that allows us to fully utilize the processor for optimizing the control performance and yet guaranteeing the schedulability of all tasks under worst-case conditions.

[1] T.F. Abdelzaher, E.M. Atkins, and K.G. Shin, “QoS Negotiation in Real-Time Systems and Its Applications to Automated Flight Control,” Proc. IEEE Real-Time Technology and Applications Symp., June 1997.
[2] L. Abeni and G. Buttazzo, “Integrating Multimedia Applications in Hard Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1998.
[3] L. Abeni and G. Buttazzo, “QoS Guarantee Using Probabilistic Deadlines,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, pp. 242-249, June 1999.
[4] T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” J. Real-Time Systems, vol. 3, no. 1, pp. 67-100, 1991.
[5] S.K. Baruah, R.R. Howell, and L.E. Rosier, “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor,” J. Real-Time Systems, vol. 2, 1990.
[6] G. Beccari, S. Caselli, M. Reggiani, and F. Zanichelli, “Rate Modulation of Soft Real-Time Tasks in Autonomous Robot Control Systems,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, June 1999.
[7] G. Buttazzo, G. Lipari, and L. Abeni, “Elastic Task Model for Adaptive Rate Control,” Proc. 19th IEEE Real-Time Systems Symp., Dec. 1998.
[8] M. Caccamo, G. Lipari, and G. Buttazzo, “Sharing Resources among Periodic and Aperiodic Tasks With Dynamic Deadlines,” Proc. IEEE Real-Time Systems Symp., Dec. 1999.
[9] M. Caccamo, G. Buttazzo, and L. Sha, “Elastic Feedback Control,” IEEE Proc. 12th Euromicro Conf. Real-Time Systems, pp. 121-128, June 2000.
[10] P. Gai, L. Abeni, M. Giorgi, and G. Buttazzo, “A New Kernel Approach for Modular Real-Time systems Development,” Proc. 13th IEEE Euromicro Conf. Real-Time Systems, June 2001.
[11] M.K. Gardner and J.W.S. Liu, “Performance of Algorithms for Scheduling Real-time Systems with Overrun and Overload,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, June 1999.
[12] T.M. Ghazalie and T.P. Baker, “Aperiodic Servers in a Deadline Scheduling Environment,” J. Real-Time Systems, vol. 9, pp. 21-36, 1995.
[13] J. Leung and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks,” Performance Evaluation, vol. 2, pp 237-250 1982.
[14] 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.
[15] M. Ryu and S. Hong, “Toward Automatic Synthesis of Schedulable Real-Time Controllers,” J. Integrated Computer Aided Eng., vol. 5, no. 3, pp. 261-277, 1998.
[16] D. Seto, J.P. Lehoczky, L. Sha, and K.G. Shin, “On Task Schedulability in Real-Time Control Systems,” Proc. IEEE Real-Time Systems Symp., pp. 13-21, Dec. 1996.
[17] K.G. Shin and C.L. Meissner, “Adaptation and Graceful Degradation of Control System Performance by Task Reallocation and Period Adjustment,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, June 1999.
[18] M. Spuri and G.C. Buttazzo, “Efficient Aperiodic Service under Earliest Deadline Scheduling,” Proc. IEEE Real-Time Systems Symp., San Juan, Puerto Rico, Dec. 1994.
[19] M. Spuri, G.C. Buttazzo, and F. Sensini, “Robust Aperiodic Scheduling under Dynamic Priority Systems,” Proc. IEEE Real-Time Systems Symp., Pisa, Italy, Dec. 1995.
[20] M. Spuri and G.C. Buttazzo, “Scheduling Aperiodic Tasks in Dynamic Priority Systems,” J. Real-Time Systems, vol. 10, no. 2, 1996.
[21] J.A. Stankovic, C. Lu, S. Son, and G. Tao, “The Case for Feedback Control Real-Time Scheduling,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, June 1999.
[22] C. Lu, J.A. Stankovic, G. Tao, and S.H. Son, “Design and Evaluation of a Feedback Control EDF Scheduling Algorithm,” Proc. IEEE Real-Time Systems Symp., Dec. 1999.

Index Terms:
Overrun management, rate adaptation, real-time scheduling.
Citation:
Marco Caccamo, Giorgio Buttazzo, Lui Sha, "Handling Execution Overruns in Hard Real-Time Control Systems," IEEE Transactions on Computers, vol. 51, no. 7, pp. 835-849, July 2002, doi:10.1109/TC.2002.1017703
Usage of this product signifies your acceptance of the Terms of Use.