This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
March 2006 (vol. 55 no. 3)
pp. 320-333
Many real-time systems have firm real-time requirements which allow occasional deadline violations but discard any jobs that are not finished by their deadlines. To measure the performance of such a system, a quality of service (QoS) metric is needed. Examples of often used QoS metrics for firm real-time systems are average deadline miss rates and (m,k){\hbox{-}}firm constraints. However, for certain applications, these metrics may not be adequate measures of system performance. This paper introduces a novel QoS constraint for firm real-time systems. The new QoS constraint generalizes existing firm real-time constraints. Furthermore, using networked control system as an example, we show that this constraint can be directly related to the control system's performance. We then present three different scheduling approaches with respect to this QoS constraint. Experimental results are provided to show the effectiveness of these approaches.

[1] T.F. Abdelzaher, K. Shin, and N. Bhatti, “Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 80-96, Jan. 2002.
[2] S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, “On the Competitiveness of On-Line Real-Time Task Scheduling,” Real-Time Systems, vol. 4, pp. 125-144, 1992.
[3] S. Baruah, J. Haritsa, and N. Sharma, “Scheduling for Overload in Real-Time Systems,” IEEE Trans. Computers, vol. 46, no. 9, pp. 1034-1039, Sept. 1997.
[4] G. Bernat, A. Burns, and A. Llamosi, “Weakly Hard Real-Time Systems,” IEEE Trans. Computers, vol. 50, no. 4, pp. 308-321, Apr. 2001.
[5] P.R. Blevins and C.V. Ramamoorthy, “Aspects of a Dynamically Adaptive Operating Systems,” IEEE Trans. Computers, vol. 25, no. 7, pp. 713-725, July 1976.
[6] S. Brandt, G. Nutt, T. Berk, and J. Mankovich, “A Dynamic Quality of Service Middleware Agent for Mediating Application Resource Usage,” Proc. Real-Time Systems Symp., pp. 307-317, 1998.
[7] J.L. Diaz, D.F. Garcia, K. Kim, C. Lee, L. Lo Bello, J.M. Lopez, L.M. Sang, and O. Mirabella, “Stochastic Analysis of Periodic Real-Time Systems,” Proc. Real-Time Systems Symp., pp. 289-300, 2002.
[8] M. Hamdaoui and P. Ramanathan, “A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines,” IEEE Trans. Computers, vol. 44, pp. 1443-1451, 1995.
[9] J.R. Haristsa, M. Livny, and M.J. Carey, “Earliest Deadline Scheduling for Real-Time Database Systems,” Proc. Real-Time Systems Symp., pp. 232-242, 1991.
[10] A. Kalavade and P. Mogh, “A Tool for Performance Estimation of Networked Embedded End-Systems,” Proc. Design Automation Conf., pp. 257-262, 1998.
[11] S. Manolache, P. Eles, and Z. Peng, “Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time,” Proc. 13th Euromicro Conf. Real-Time Systems, pp. 19-26, 2001.
[12] G. Koren and D. Shasha, “Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips,” Proc. Real-Time Systems Symp., pp. 110-117, 1995.
[13] Q. Ling and M.D. Lemmon, “Robust Performance of Soft Real-Time Networked Control Systems with Data Dropouts,” Proc. IEEE Conf. Decision and Control, vol. 2, pp. 1225-1230, 2002.
[14] Q. Ling and M.D. Lemmon, “Soft Real-Time Scheduling of Networked Control Systems with Dropouts Governed by a Markov Chain,” Proc. Am. Control Conf., 2003.
[15] S.K. Park and K.W. Miller, “Random Number Generators: Good Ones Are Hard to Find,” Comm. ACM, vol. 31, no. 10, pp. 1192-1201, 1988.
[16] C. Lu, J.A. Stankovic, S.H. Son, and T. Gang, “Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms,” Real-Time Systems, vol. 23, nos. 1-2, pp. 85-126, 2002.
[17] G. Quan and X. Hu, “Enhanced Fixed-Priority Scheduling with (m, k)-Firm Guarantee,” Proc. IEEE Real-Time Systems Symp., pp. 79-88, 2000.
[18] P. Ramanathan, “Overload Management in Real-Time Control Applications Using (m, k)-Firm Guarantee,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 6, pp. 549-559, June 1999.
[19] D.R. Sahoo, S. Swaminathan, R. Al-Omari, G. Manimaran, M. Salapaka, and A. Soomani, “Feedback Control for Real-Time Scheduling,” Proc. Am. Control Conf., vol. 2, pp. 1254-1259, 2002.
[20] J.A. Stankovic, C. Lu, S.H. Son, and T. Gang, “The Case for Feedback Control Real-Time Scheduling,” Proc. 11th Euromicro Conf. Real-Time Systems, pp. 11-20, 1999.
[21] T.-S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.-C. Wu, and J.W.-S. Liu, “Probabilistic Performance Guarantee for Real-Time Tasks with Varying Computation Times,” Proc. Real-Time Technology and Applications Symp., pp. 164-173, 1995.
[22] R. West and C. Poellabauer, “Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams,” Proc. Real-Time Systems Symp., pp. 239-248, 2000.
[23] A.K. Mok and W. Wang, “Window-Constrained Real-Time Periodic Task Scheduling,” Proc. IEEE Real-Time Systems Symp., pp. 15-24, 2001.
[24] G. Bernat and R. Cayssials, “Guaranteed On-Line Weakly-Hard Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., pp. 25-34, 2001.
[25] T. Loukil, J. Teghem, and D. Tuyttens, “Solving Multi-Objective Production Scheduling Problems Using Metaheuristics,” European J. Operational Research, 2003.
[26] B. Efron and R.J. Tibshirani, An Introduction to the Bootstrap. Chapman and Hall, 1993.
[27] L.R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” Proc. IEEE, vol. 77, no. 2, 1989.

Index Terms:
Firm real-time system, scheduling, quality of service, networked control system.
Citation:
Donglin Liu, Xiaobo Sharon Hu, Michael D. Lemmon, Qiang Ling, "Firm Real-Time System Scheduling Based on a Novel QoS Constraint," IEEE Transactions on Computers, vol. 55, no. 3, pp. 320-333, March 2006, doi:10.1109/TC.2006.41
Usage of this product signifies your acceptance of the Terms of Use.