Rate Monotonic vs. EDF: Judgment Day

  • Giorgio C. Buttazzo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2855)


Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Unfortunaltey, many misconceptions still exist about the properties of these two scheduling methods, which usually tend to favor RM more than EDF. Typical wrong statements often heard in technical conferences and even in research papers claim that RM is easier to analyze than EDF, it introduces less runtime overhead, it is more predictable in transient overload conditions, and causes less jitter in task execution. Since the above statements are either wrong, or not precise, it is time to clarify these issues in a systematic fashion, because the use of EDF allows a better exploitation of the available resources and significantly improves system’s performance. This paper compares RM against EDF under several aspects, using existing theoretical results or simple counterexamples to show that many common beliefs are either false or only restricted to specific situations.


Processor Utilization Earliest Deadline First Periodic Task Schedulability Analysis Runtime Overhead 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abeni, L., Buttazzo, G.: Integrating Multimedia Applications in Hard Real- Time Systems. In: Proc. of the IEEE Real-Time Systems Symposium, Madrid, Spain (December 1998)Google Scholar
  2. 2.
    Audsley, N.C., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying New Scheduling Theory to Static Priority Preemptive Scheduling. Software Engineering Journal 8(5), 284–292 (1993)CrossRefGoogle Scholar
  3. 3.
    Baker, T.P.: Stack-Based Scheduling of Real-Time Processes. The Journal of Real- Time Systems 3(1), 76–100 (1991)Google Scholar
  4. 4.
    Baruah, S., Buttazzo, G., Gorinsky, S., Lipari, G.: Scheduling Periodic Task Systems to Minimize Output Jitter. In: Proceedings of the 6th IEEE International Conference on Real-Time Computing Systems and Applications, Hong Kong (December 1999)Google Scholar
  5. 5.
    Baruah, S.K., Howell, R.R., Rosier, L.E.: Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor. Real-Time Systems 2 (1990)Google Scholar
  6. 6.
    Bini, E., Buttazzo, G.C., Buttazzo, G.M.: A Hyperbolic Bound for the Rate Monotonic Algorithm. In: Proceedings of the 13th Euromicro Conference on Real- Time Systems, Delft, The Netherlands, June 2001, pp. 59–66 (2001)Google Scholar
  7. 7.
    Bini, E., Buttazzo, G.C.: The Space of Rate Monotonic Schedulability. In: Proceedings of the 23rd IEEE Real-Time Systems Symposium, Austin, Texas (December 2002)Google Scholar
  8. 8.
    Buttazzo, G.C.: HARTIK: A Real-Time Kernel for Robotics Applications. In: Proceedings of the 14th IEEE Real-Time Systems Symposium, Raleigh-Durham (December 1993)Google Scholar
  9. 9.
    Buttazzo, G., Stankovic, J.: Adding Robustness in Dynamic Preemptive Scheduling. In: Fussell, D.S., Malek, M. (eds.) Responsive Computer Systems: Steps Toward Fault-Tolerant Real- Time Systems, Kluwer Academic Publishers, Boston (1995)Google Scholar
  10. 10.
    Buttazzo, G., Sensini, F.: Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments. IEEE Transactions on Computers 48(10) (October 1999)Google Scholar
  11. 11.
    Buttazzo, G., Lipari, G., Caccamo, M., Abeni, L.: Elastic Scheduling for Flexible Workload Management. IEEE Transactions on Computers 51(3), 289–302 (2002)CrossRefGoogle Scholar
  12. 12.
    Chen, M.I., Lin, J.K.: Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time Systems. Journal of Real-Time Systems 2 (1990)Google Scholar
  13. 13.
    Dertouzos, M.L.: Control Robotics: the Procedural Control of Physical Processes. Information Processing 74, North-Holland Publishing Company (1974)Google Scholar
  14. 14.
    Gai, P., Lipari, G., Di Natale, M.: A Flexible and Configurable Real-Time Kernel for Time Predictability and Minimal Ram Requirements. Technical Report, Scuola Superiore S. Anna, Pisa, RETIS TR2001–02 (March 2001)Google Scholar
  15. 15.
    Gai, P., Abeni, L., Giorgi, M., Buttazzo, G.: A New Kernel Approach for Modular Real-TIme Systems Development. In: Proceedings of the 13th Euromicro Conference on Real-Time Systems, Delft (NL) (June 2001)Google Scholar
  16. 16.
    Jeffay, K.: Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems. In: Proceedings of IEEE Real-Time System Symposium, December 1992, pp. 89–99 (1992)Google Scholar
  17. 17.
    Jeffay, K., Stone, D.L., Poirier, D.: YARTOS: Kernel support for efficient, predictable real-time systems. Real-Time Systems Newsletter 7(4), 8–13 (1991); Republished in Real-Time Programming, Halang, W., Ramamritham, K. (eds.) Pergamon Press, Oxford, UK (1992)Google Scholar
  18. 18.
    Joseph, M., Pandya, P.: Finding Response Times in a Real-Time System. The Computer Journal 29(5), 390–395 (1986)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Koren, G., Shasha, D.: Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips. In: Proc. of the IEEE Real-Time Systems Symposium (1995)Google Scholar
  20. 20.
    Lehoczky, J.P., Sha, L., Strosnider, J.K.: Enhanced Aperiodic Responsiveness in Hard Real-Time Environments. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 261–270 (1987)Google Scholar
  21. 21.
    Lehoczky, J.P., Sha, L., Ding, Y.: The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behaviour. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 166–171 (1989)Google Scholar
  22. 22.
    Lehoczky, J.P., Ramos-Thuel, S.: An Optimal Algorithm for Scheduling Soft- Aperiodic Tasks in Fixed-Priority Preemptive Systems. In: Proceedings of the IEEE Real-Time Systems Symposium (1992)Google Scholar
  23. 23.
    Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard real-Time Environment. Journal of the ACM 20(1), 40–61 (1973)CrossRefMathSciNetGoogle Scholar
  24. 24.
    Locke, J.: Designing Real-Time Systems. In: IEEE International Conference of Real-Time Computing Systems and Applications (RTCSA 1997), Taiwan (December 1997) (invited talk)Google Scholar
  25. 25.
    Marti, P., Fohler, G., Ramamritham, K., Fuertes, J.M.: Control performance of flexible timing constraints for Quality-of-Control Scheduling. In: Proc. of the 23rd IEEE Real-Time System Symposium, Austin, TX, USA (December 2002)Google Scholar
  26. 26.
    Mercer, C.W., Savage, S., Tokuda, H.: Processor Capacity Reserves for Multimedia Operating Systems. Technical Report, Carnegie Mellon University, Pittsburg (PA), CMU-CS-93-157 (May 1993)Google Scholar
  27. 27.
    Aldea Rivas, M., González Harbour, M.: POSIX-Compatible Application- Defined Scheduling in MaRTE OS. In: Euromicro Conference on Real-Time Systems (WiP), Delft, The Netherlands (June 2001)Google Scholar
  28. 28.
    Sha, L., Rajkumar, R., Lehoczky, J.P.: Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computers 39(9), 1175–1185 (1990)CrossRefMathSciNetGoogle Scholar
  29. 29.
    Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic Task Scheduling for Hard Real-Time System. Journal of Real-Time Systems 1, 27–60 (1989)CrossRefGoogle Scholar
  30. 30.
    Spuri, M., Buttazzo, G.C.: Efficient Aperiodic Service under Earliest Deadline Scheduling. In: Proceedings of IEEE Real-Time System Symposium, San Juan, Portorico (December 1994)Google Scholar
  31. 31.
    Spuri, M., Buttazzo, G.C., Sensini, F.: Robust Aperiodic Scheduling under Dynamic Priority Systems. In: Proc. of the IEEE Real-Time Systems Symposium, Pisa, Italy (December 1995)Google Scholar
  32. 32.
    Spuri, M., Buttazzo, G.C.: Scheduling Aperiodic Tasks in Dynamic Priority Systems. Real-Time Systems 10(2) (1996)Google Scholar
  33. 33.
    Stankovic, J., Ramamritham, K.: The Design of the Spring Kernel. In: Proceedings of the IEEE Real-Time Systems Symposium (December 1987)Google Scholar
  34. 34.
    Strosnider, J.K., Lehoczky, J.P., Sha, L.: The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments. IEEE Transactions on Computers 44(1) (January 1995)Google Scholar
  35. 35.
    Stankovic, J., Ramamritham, K., Spuri, M., Buttazzo, G.: Deadline Scheduling for Real-Time Systems. Kluwer Academic Publishers, Boston (1998)zbMATHGoogle Scholar
  36. 36.
    Tia, T.-S., Liu, J.W.-S., Shankar, M.: Algorithms and Optimality of Scheduling Aperiodic Requests in Fixed-Priority Preemptive Systems. Journal of Real-Time Systems 10(1), 23–43 (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Giorgio C. Buttazzo
    • 1
  1. 1.University of PaviaItaly

Personalised recommendations