Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30184
Research on Weakly Hard Real-Time Constraints and Their Boolean Combination to Support Adaptive QoS

Authors: Xiangbin Zhu

Abstract:

Advances in computing applications in recent years have prompted the demand for more flexible scheduling models for QoS demand. Moreover, in practical applications, partly violated temporal constraints can be tolerated if the violation meets certain distribution. So we need extend the traditional Liu and Lanland model to adapt to these circumstances. There are two extensions, which are the (m, k)-firm model and Window-Constrained model. This paper researches on weakly hard real-time constraints and their combination to support QoS. The fact that a practical application can tolerate some violations of temporal constraint under certain distribution is employed to support adaptive QoS on the open real-time system. The experiment results show these approaches are effective compared to traditional scheduling algorithms.

Keywords: Weakly Hard Real-Time, Real-Time, Scheduling, Quality of Service.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1062112

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1237

References:


[1] C L Liu and J W Layland, "Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment," Journal of the ACM ,20(1), 1973: 40-61
[2] Liu J W S, Real-Time Systems.Upper Saddle River: Prentice Hall, 2000
[3] Nimal Nissanke, Real-time System. Prentice Hall, 1997
[4] M Hamdaoui and P Ramnathan, "A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines," IEEE Transactions on Computers, 1995, 44(12): 1443-1451
[5] G. Bernat and A. Burns, "Combining (n,m)-hard deadlines and dual priority scheduling," In RTSS, Dec 1997.
[6] G. Bernat and R. Cayssials, " Guarantted on-line weakly-hard real-time systems," In RTSS, 2001.
[7] Richard West and Karsten Schwan, "Dynamic Window-Constrained Scheduling for Multimedia Applications," In 6th Proceedings of the IEEE International Conference on Multimedia Computing and Systems (ICMCS), Florence, Italy: IEEE.1999.87~91
[8] Richard West and Christian Poellabauer, "Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams," In: Proc of the 21st IEEE Real-Time Systems Symposium (RTSS), Orlando: IEEE Computer Society, 2000.239~248
[9] G Bernat,A Burns and A Liamosi, "Weakly Hard Real-Time Systems," IEEE Transactions on Computers, 2001 50(4): 308~321
[10] G Bernat, "Specification and Analysis of Weakly Hard Real-Time Systems," PhD thesis, Universitat de les Illes Balears, Spain, 1998
[11] Deng Z, Liu JWS, Sun J, "A scheme for scheduling hard-real-time applications in open environment," In: Proceedings of the 9th Euromicro Workshop on Real-Time Systems, Los Alamitos, CA: IEEE Computer Society Press, 1997: 155-185.
[12] Z. Deng and J. W. S. Liu, "Scheduling real-time applications in open envirovment," In IEEE Real- Time Systems Symposium, San Francisco, December 1997.
[13] G. Lipari and G.C. Buttazzo, " Scheduling real-time multi-task applications in an open system," In proceeding of the 11th Euromicro Workshop on Real-Time Systems, York, UK, June 1999
[14] Giuseppe Lipari and Sanjoy Baruah, "Efficient scheduling of real-time multi-task applications in dynamic systems," Proceedings of the Real-Time Technology and Applications Symposium, pp 166-175, Washington, DC. May 2000. IEEE Computer Society Press.
[15] Luca Abeni and Giorgio Buttazzo, "Integrating multimedia applications in hard real-time systems,"In proceedings of the IEEE Real-Time Systems Symposim, Madrid, Spain, December 1998.
[16] Luca Marzario ,Giuseppe Lipari Patricia ,Balbastre and Alfons Crespo, " IRIS: A new reclaiming algorithm for server-based real-time systems," Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium, Toronto: IEEE Computer Society Press ,May 2004:211-218
[17] A.K.Mok and W.Wang, "Window-constraint real-time periodic task scheduling," In RTSS, 2001.