Quality of Service Scheduling in Real-Time Systems
AbstractIn this paper, we deal with dynamic scheduling components integrating new Quality of Service (QoS) functionalities into a Linux-based real-time operating system. In our approach, periodic tasks allow occasional deadline violations within given bounds specified according to the Skip-Over task model. Hence, every task has a minimal QoS guarantee which is expressed by the ratio of periodic task instances which must complete before their deadline. The work stated here provides two on-line scheduling algorithms, namely RLP and RLP/T, which enhance the existing Skip-Over algorithms. More specifically, the proposed algorithms aim at improving the actual QoS observed for periodic tasks (which is always greater or equal to the QoS guarantee). These novel scheduling techniques rely on the EDL (Earliest Deadline as Late as possible) scheduling strategy. Simulation results show the performance of RLP and RLP/T with respect to basic Skip-Over algorithms. Finally, we present the integration of these QoS scheduling services into CLEOPATRE open-source component library, a patch to Linux/RTAI.
 G. Bernat, A. Burns, A. Llamosi, Weakly-hard real-time systems, In IEEE Transactions on Comput- ers, Vol. 50, No. 4, pp 308-321, 2001.
 G.-C. Buttazzo, M. Caccamo, Minimizing Aperiodic Response Times in a Firm Real-Time Environment, IEEE Trans. Software Eng., Vol. 25, No. 1, pp 22-32, 1999.
 M. Caccamo, G.-C. Buttazzo, Exploiting skips in periodic tasks for enhancing aperiodic responsivess, 18th IEEE Real-Time Systems Symposium, 1997.
 H. Chetto, M. Chetto, Some Results of the Earliest Deadline Scheduling Algorithm. In Proceedings of the IEEE Transactions on Software Engineering, Vol. 15, No. 10, pp 1261-1269, 1989.
 T. Garcia, A. Marchand, M. Silly-Chetto, Cleopatre: a R&D project for providing new real-time functionalities to Linux/RTAI. 5th Real-Time Linux Workshop, 2003.
 M. Hamdaoui, P. Ramanathan, A Dynamic Priority Assignment Technique for Streams with (m,k)- firm deadlines. IEEE Transactions on Computers, Vol. 44, No. 4, pp 1443-1451, 1995.
 G. Koren, D. Shasha, Skip-Over Algorithms and Complexity for Overloaded Systems that Allow Skips. 16th IEEE Real-Time Systems Symposium (RTSS'95), Pisa, Italy, 1995.
 P. Mantegazza, E. Bianchi, L. Dozio, M. Angelo, D. Beal, DIAPM. RTAI Programming Guide 1.0, Lineo Inc., 2000.
 A. Marchand, M. Silly-Chetto, QoS Scheduling Components based on Firm Real-Time Requirements, ACS/IEEE International Conference on Computer Systems and Applications (AICCSA'05), Le Caire (Egypt), 2005.
 A. Marchand and M. Silly-Chetto, RLP: Enhanced QoS Support for Real-Time Applications, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), Hong-Kong, 2005.
 A. Marchand, M. Silly-Chetto, Dynamic Real-Time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks. Journal of Real-Time Systems, Vol. 32, No. 1-2, pp 21-47, 2006.
 M. Silly-Chetto, The EDL Server for Scheduling Periodic and Soft Aperiodic Tasks with Resource Constraints, Journal of Real-Time Systems, Vol. 17, pp 1-25, 1999.
 M. Silly-Chetto, H. Chetto, N. Elyounsi, An Optimal Algorithm for Guranteeing Sporadic Tasks in Hard Real-Time Systems. IEEE Symposium on Parallel and Distributed Processing, pp 578-585, 1990.
 T. Tia, J. Liu, J. Sun, R. Ha, A Linear-Time Optimal Acceptance Test for Scheduling of Hard Real- Time Tasks, Technical report, Department of Computer Science, University of Illinois at Urbana- Champaign, IL, 1994.
 R. West, C. Poellabauer, Analysis of a Window-constrained scheduler for real-time and best-effort packet streams, 21st IEEE Real-Time Systems Symposium, Orlando, USA, 2000.
 R. West, Y. Zhang, K. Schwan, C. Poellabauer, Dynamic window-constrained scheduling of realtime streams in media servers, IEEE Trans. on Computers, Vol. 53, pp. 744-759, 2004.
 V. Yodaiken, The RTLinux Approach to Real-Time, FSMLabs Inc., 2004.
 Y. Zhang, R. West, X. Qi, Avirtual deadline scheduler for window-constrained service guarantees, Tech. Rep. 2004-013, Boston University, 2004.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.