Schedulability Analysis of Fixed Priority Servers for Scheduling Aperiodic Real-Time Tasks – A Review

Abstract:

This paper focus on the schedulability analysis of fixed priority servers. A number of fixed priority servers and their schedulability analysis are reviewed, these results and properties can be used for constructing systems with different timing constraints, where real-time tasks with hard deadlines and the soft aperiodic tasks can be scheduled in the same system. The aperiodic tasks in the fixed priority servers are not preemptable, and they are scheduled in a first-come first-served manner. There is only one server with many periodic or sporadic tasks in the system. The tasks and the server are scheduled by a fixed priority algorithm such as rate monotonic or deadline monotonic.

• Periodical: Applied Mechanics and Materials (Volumes 651-653)
• Pages: 1933-1936
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.651-653.1933
• Online since: September 2014
• Authors: Feng Xiang Zhang
• Keywords: Fixed Priority, Real-Time System, Schedulability Analysis, Scheduling, Server Algorithms

References

[1] C.L. Liu, J.W. Layland. Scheduling Algorithm for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20(1): 40-61, (1973).

DOI: 10.1145/321738.321743

[2] J. Leung, J.W. Whitehead. On the Complexity of Fixed Priority Scheduling of Periodic Real-Time Tasks. Performance Evaluation, 2(4): 237-250, (1982).

DOI: 10.1016/0166-5316(82)90024-4

[3] L. Sha, J.P. Lehoczky, R. Rajkumar. Solutions for some Parctical Problems in Prioritised Preemptive Scheduling. Proceedings IEEE Real-Time Systems Symposium, pp.181-191, (1986).

[4] B. Sprunt, L. Sha, J.P. Lehoczky. Aperiodic Task Scheduling for Hard Real-Time Systems. Real-Time Systems, 11(1): 19-39, (1989).

DOI: 10.1007/bf02341920

[5] J.P. Lehoczky, L. Sha, J.K. Strosnider. Enhanced Aperiodic Responsiveness in a Hard Real-Time Environment. Proceedings 8th IEEE Real-Time Systems Symposium, pp.261-270, (1987).

DOI: 10.1109/12.368008

[6] J.K. Strosnider, J.P. Lehoczky, L. Sha. The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments. IEEE Transactions on Computers, 44(1): 73-91, (1995).

DOI: 10.1109/12.368008

[7] L.P. Lehoczky, L. Sha, J.K. Strosnider. Enhanced Aperiodic Responsiveness in Hard Real-Time Environments. Proceedings IEEE Real-Time Systems Symposium, (1987).

DOI: 10.1109/12.368008

[8] J.P. Lehoczky, S.R. Thuel. An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems. Proceedings of the IEEE Real-Time Systems Symposium, (1992).

DOI: 10.1109/real.1992.242671

[9] S.R. Thuel, J.P. Lehoczky. On-line Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority Systems. Proceedings IEEE Real-Time Systems Symposium, (1993).

DOI: 10.1109/real.1993.393504

[10] T.S. Tia, J.W.S. Liu, M. Shankar. Algorithms and Optimality of Scheduling Aperiodic Requests in Fixed-Priority Preemptive Systems. Real-Time Systems, (1995).

DOI: 10.1007/bf00357882

[11] G. Bernat, A. Burns. New Results on Fixed Priority Aperiodic Servers. Proceedings IEEE Real-Time Systems Symposium, pp.68-78, (1999).

DOI: 10.1109/real.1999.818829

[12] B. Sprunt. Aperiodic Task Scheduling for Real-Time Systems. Ph.D. Dissertation, Department of Electrical and Computer Engineering, Carnegie Mellon University, (1990).