Most existing scheduling algorithms for hard real-time systems apply either to periodic tasks or aperiodic tasks but not to both. In practice, real-time systems require an integrated, consistent approach to scheduling that is able to simultaneously meet the timing requirements of hard deadline periodic tasks, hard deadline aperiodic (alert-class) tasks, and soft deadline aperiodic tasks. This paper introduces the Deferrable Server (DS) algorithm which will be shown to provide improved aperiodic response time performance over traditional background and polling approaches. Taking advantage of the fact that, typically, there is no benefit in early completion of the periodic tasks, the Deferrable Server (DS) algorithm assigns higher priority to the aperiodic tasks up until the point where the periodic tasks would start to miss their deadlines. Guaranteed alert-class aperiodic service and greatly reduced response times for soft deadline aperiodic tasks are important features of the DS algorithm, and both are obtained with the hard deadlines of the periodic tasks still being guaranteed. The results of a simulation study performed to evaluate the response time performance of the new algorithm against traditional background and polling approaches are presented. In all cases, the response times of aperiodic tasks are significantly reduced (often by an order of magnitude) while still maintaining guaranteed periodic task deadlines. >
[1]
J. Leung,et al.
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks
,
1980,
Inf. Process. Lett..
[2]
John P. Lehoczky,et al.
The rate monotonic scheduling algorithm: exact characterization and average case behavior
,
1989,
[1989] Proceedings. Real-Time Systems Symposium.
[3]
Charles U. Martel,et al.
Scheduling Periodically Occurring Tasks on Multiple Processors
,
1981,
Inf. Process. Lett..
[4]
Krithi Ramamritham,et al.
The Design of the Spring Kernel
,
1987,
RTSS.
[5]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[6]
Jay Kurt Strosnider.
Highly responsive real time token rings
,
1988
.
[7]
Jane W.-S. Liu,et al.
Scheduling Real-Time, Periodic Jobs Using Imprecise Results
,
1987,
RTSS.
[8]
Lui Sha,et al.
Solutions for Some Practical Problems in Prioritized Preemptive Scheduling
,
1986,
RTSS.
[9]
Aloysius Ka-Lau Mok,et al.
Fundamental design problems of distributed systems for the hard-real-time environment
,
1983
.
[10]
Mathai Joseph,et al.
Finding Response Times in a Real-Time System
,
1986,
Comput. J..