This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments
October 1999 (vol. 48 no. 10)
pp. 1035-1052

Abstract—In this paper, we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the proposed algorithm is that it can easily be tuned to balance performance versus complexity for adapting it to different application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other methods, such as Background, the Total Bandwidth Server, and the Slack Stealer. Resource reclaiming and extensions to more general cases are also considered. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the performance of the Total Bandwidth Server up to the optimal behavior.

[1] T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” J. Real-Time Systems, vol. 3, no. 1, pp. 67-100, 1991.
[2] S.K. Baruah, R.R. Howell, and L.E. Rosier, “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor,” J. Real-Time Systems, vol. 2, 1990.
[3] H. Chetto and M. Chetto, “Some Results of the Earliest Deadline Scheduling Algorithm,” IEEE Trans. Software Eng., vol. 15, no. 10, pp. 1,261-1,269, Oct. 1989.
[4] H. Chetto, M. Silly, and T. Bouchentouf, “Dynamic Scheduling of Real-Time Tasks under Precedence Constraints,” J. Real-Time Systems, vol. 2, pp. 181-194, 1990.
[5] R.I. Davis, K.W. Tindell, and A. Burns, “Scheduling Slack Time in Fixed Priority Preemptive Systems,” Proc. Real-Time Systems Symp., pp. 222-231, 1993.
[6] M.L. Dertouzos, “Control Robotics: The Procedural Control of Physical Processes,” Information Processing, vol. 74, 1974.
[7] T.M. Ghazalie and T.P. Baker, “Aperiodic Servers in a Deadline Scheduling Environment,” J. Real-Time Systems, vol. 9, pp. 21-36, 1995.
[8] K. Jeffay, “Scheduling Sporadic Tasks with Shared Resources in Hard Real-Time Systems,” Proc. IEEE Real-Time System Symp., pp. 89-99, Dec. 1992.
[9] K. Jeffay and D.L. Stone, “Accounting for Interrupt Handling Costs in Dynamic Priority Task Systems,” Proc. IEEE Real-Time System Symp., pp. 212-221, Dec. 1993.
[10] J.P. Lehoczky, L. Sha, and J.K. Strosnider, “Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” Proc. Real-Time Systems Symp., pp. 261-270, 1987.
[11] J.P. Lehoczky and S. Ramos-Thuel, “An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems,” Proc. Real-Time Systems Symp., pp. 110-123, 1992.
[12] G. Lipari and G. Buttazzo, “Schedulability Analysis of Periodic and Aperiodic Tasks with Resource Constraints,” J. Systems Architectures, to appear.
[13] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[14] A.K. Mok, “Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment,” PhD dissertation, Massachusetts Inst. of Tech nology, 1983
[15] S. Ramos-Thuel and J.P. Lehoczky, “On-Line Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority Systems,” Proc. Real-Time Systems Symp., pp. 160-171, 1993.
[16] B. Sprunt, L. Sha, and J.P. Lehoczky, “Aperiodic Task Scheduling for Hard-Real-Time Systems,” J. Real-Time Systems, vol. 1, pp. 27-60, 1989.
[17] M. Spuri and G.C. Buttazzo, “Efficient Aperiodic Service under Earliest Deadline Scheduling,” Proc. IEEE Real-Time Systems Symp., San Juan, Puerto Rico, Dec. 1994.
[18] M. Spuri, G.C. Buttazzo, and F. Sensini, “Robust Aperiodic Scheduling under Dynamic Priority Systems,” Proc. IEEE Real-Time Systems Symp., Pisa, Italy, Dec. 1995.
[19] M. Spuri and G.C. Buttazzo, “Scheduling Aperiodic Tasks in Dynamic Priority Systems,” J. Real-Time Systems, vol. 10, no. 2, 1996.
[20] J.K. Strosnider, J.P. Lehoczky, and L. Sha, “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” IEEE Trans. Computers, vol. 44, no. 1, Jan. 1995.
[21] T.S. Tia, J.W.S. Liu, and M. Shankar, “Algorithms and Optimality of Scheduling Aperiodic Requests in Fixed-Priority Preemptive Systems,” J. Real-Time Systems, 1995.

Index Terms:
Real-time scheduling, aperiodic service, responsiveness, soft tasks.
Citation:
Giorgio C. Buttazzo, Fabrizio Sensini, "Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments," IEEE Transactions on Computers, vol. 48, no. 10, pp. 1035-1052, Oct. 1999, doi:10.1109/12.805154
Usage of this product signifies your acceptance of the Terms of Use.