Introduction to Earliest Deadline First (EDF) Algorithm 8


  • It is an Optimal dynamic Priority Scheduling Algorithm
  • Priorities are assigned based on the absolute deadlines of the task, earlier the deadline, higher the priority.
  • It is also called as Deadline Monotonic Scheduling (DM).
  • If two tasks have the same deadline, then EDF randomly select ¬†one to execute next.
  • The Schedulability condition for EDF is edf

where U is the processor Utilisation Factor and it never be greater than 1.

In practical, no processor will be utilised for more than 100%.


About TS Pradeepkumar

I am a professor by profession and a learner by life. Working in VIT University, Chennai, India and love to code and do things in open source technologies. Though from electrical engineering, I am fond of doing things in Computing and its way.


Leave a comment

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code class="" title="" data-url=""> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong> <pre class="" title="" data-url=""> <span class="" title="" data-url="">

8 thoughts on “Introduction to Earliest Deadline First (EDF) Algorithm