The Algorithms of Dynamic Servers for Scheduling Aperiodic Real-Time Tasks – A Review

Abstract:

This paper focus on the dynamic server algorithms, and the servers are used for scheduling soft aperiodic tasks. Many types of servers and their schedulability analysis are reviewed, these properties can be used for constructing hierarchical embedded systems, where the soft aperiodic tasks and the hard real-time tasks can be scheduled in the same system. The aperiodic tasks in the server are not preemptable, and they are executed in a first-come first-served (FCFS) manner. If it is not specified, there is only one server in the system, and rest of the processes in the system are ordinary periodic tasks. The servers could be scheduled by fixed priority or dynamic algorithms.

• Periodical: Advanced Materials Research (Volumes 945-949)
• Pages: 3380-3383
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.945-949.3380
• Online since: June 2014
• Authors: Feng Xiang Zhang*
• Keywords: Aperiodic Task, Fixed Priority, Schedulability Analysis, Scheduling, Server Algorithms

References

[1] H. Chetto, M. Chetto. Some Results of the Earliest Deadline Scheduling Algorithm. IEEE Transactions on Software Engineering, 15(10): 1261-1269, (1989).

DOI: 10.1109/tse.1989.559777

[2] T.M. Ghazalie, T.P. Baker. Aperiodic Servers in a Deadline Scheduling Environment. Real-Time Systems, 9(1): 31-67, (1995).

DOI: 10.1007/bf01094172

[3] M. Spuri, G. Buttazzo. Efficient Aperiodic Service under Earliest Deadline Scheduling. Proceedings IEEE Real-Time Systems Symposium, (1994).

DOI: 10.1109/real.1994.342735

[4] M. Spuri, G. Buttazzo. Scheduling Aperiodic Tasks in Dynamic Priority Systems. Real-Time Systems, 10(2): 179-210, (1996).

DOI: 10.1007/bf00360340

[5] L. Abeni, G. Buttazzo. Integrating Multimedia Applications in Hard Real-Time Systems. Proceedings 19th IEEE Real-Time Systems Symposium, pp.4-13, (1998).

DOI: 10.1109/real.1998.739726

[6] G. Buttazzo, F. Sensini. Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments. IEEE Transactions on Computers, 48(10): 1035-1052, (1999).

DOI: 10.1109/12.805154

[7] 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).

[8] 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

[9] 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

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