An important class of scheduling algorithms is the class of dynamic priority algorithms. The most important dynamic priority algorithm is Earliest Deadline First (EDF). Earliest-deadline-first (EDF) is good for scheduling real-time tasks in or