This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Analysis of EDF Schedulability on a Multiprocessor
August 2005 (vol. 16 no. 8)
pp. 760-768

Abstract—A new schedulability test is derived for preemptive deadline scheduling of periodic or sporadic real-time tasks on a single-queue m-server system. The new test allows the task deadline to be more or less than the task period, and is based on a new analysis concept, called a \mu{\hbox{-}}{\rm{busy}} interval. This generalizes a result of Goossens et al. [11] that a system of periodic tasks with maximum individual task utilization u_{max} is EDF-schedulable on m processors if the total utilization does not exceed m(1-u_{max})+u_{max}. The new test allows the analysis of hybrid EDF-US [x] scheduling, and the conclusion that EDF-US[1/2] is optimal, with a guaranteed worst-case schedulable utilization of (m+1)/2.

[1] B. Andersson, “Static-Priority Scheduling on Multiprocessors,” PhD thesis, Dept. of Computer Eng., Chalmers Univ. of Technology, Göteborg, Sweden, 2003.
[2] B. Andersson, S. Baruah, J. Jonsson, “Static-Priority Scheduling on Multiprocessors,” Proc. 21st IEEE Real-Time Systems Symp., pp. 193-202, Dec. 2001.
[3] J. Anderson and A. Srinivasan, “Early-Release Fair Scheduling,” Proc. 12th Euromicro Conf. Real-Time Systems, pp. 34-43, June 2001.
[4] T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” The Real-Time Systems J., vol. 3, no. 1, pp. 67-100, Mar. 1991.
[5] T.P. Baker, “Multiprocessor EDF and Deadline Monotonic Schedulability Analysis,” Proc. 23rd IEEE Real-Time Systems Symp., Dec. 2003.
[6] T.P. Baker, “An Analysis of Deadline-Monotonic Scheduling on a Multiprocessor,” Florida State Univ., Dept. of Computer Science, technical report, 2003.
[7] S. Baruah, N. Cohen, C.G. Plaxton, D. Varvel, “Proportionate Progress: A Notion of Fairness in Resource Allocation,” Algorithmica 15, pp. 600-625, 1996.
[8] S. Baruah, J. Gherke, C.G. Plaxton, “Fast Scheduling of Periodic Tasks on Multiple Resources,” Proc. Ninth Int'l Parallel Processing Symp., pp. 280-288, Apr. 1995.
[9] S.K. Dhall and C.L. Liu, “On a Real-Time Scheduling Problem,” Operations Research 26, vol. 1, pp. 127-140, 1978.
[10] S. Funk, J. Goossens, S. Baruah, “On-Line Scheduling on Uniform Multiprocessors,” Proc. 21st IEEE Real-Time Systems Symp., pp. 183-192, Dec. 2001.
[11] J. Goossens, S. Funk, and S. Baruah, “Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors,” Real Time Systems, vol. 25, nos. 2/3, pp. 187-205, Kluwer, Sept./Nov. 2003.
[12] T.M. Ghazalie and T.P. Baker, “Aperiodic Servers in a Deadline Scheduling Environment,” Real-Time Systems J., vol. 9, no. 1, pp. 31-68, Kluwer, July 1995.
[13] R. Ha, “Validating Timing Constraints in Multiprocessor and Distributed Systems,” PhD thesis, Technical Report UIUCDCS-R-95-1907, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1995.
[14] R. Ha and J.W. S. Liu, “Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems,” Technical Report UIUCDCS-R-93-1833, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Oct. 1993.
[15] R. Ha and J.W. S. Liu, “Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems,” Proc. 14th IEEE Int'l Conf. Distributed Computing Systems, June 1994.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[17] J.W. S. Liu, Real-Time Systems. Prentice-Hall, 2000.
[18] C.A. Phillips, C. Stein, E. Torng, and J Wein, “Optimal Time-Critical Scheduling via Resource Augmentation,” Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 140-149, 1997.
[19] A. Srinivasan and S. Baruah, “Deadline-Based Scheduling of Periodic Task Systems on Multiprocessors,” Information Processing Letters, vol. 84, pp. 93-98, 2002.

Index Terms:
Multiprocessor systems, real-time scheduling, deadline scheduling, earliest deadline first, utilization, feasibility, multiprocessor scheduling.
Citation:
Theodore P. Baker, "An Analysis of EDF Schedulability on a Multiprocessor," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 8, pp. 760-768, Aug. 2005, doi:10.1109/TPDS.2005.88
Usage of this product signifies your acceptance of the Terms of Use.