Encyclopedia > Earliest deadline first scheduling

  Article Content

Earliest deadline first scheduling

Earliest deadline first scheduling is a dynamic scheduling principle found in real-time operating systems. It will adress processes in a priority queue and run them to the end, and on the end of each execution of a process, the queue will be searched for the process closest to it's deadline. This process will then be scheduled for execution next.

Compared to static scheduling, like rate-monotonic scheduling, earliest dealine first will generally perform better, utilizing up to 100% of the CPU time. (When scheduling processor allocation time.) However, it doesn't consider priorities, and once processes start missing their deadlines, the system will be completely unpredictable.

See also: scheduling, rate-monotonic scheduling

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article

... can refer to: Christiania - the name of Oslo, from 1624 to 1925. The Free State of Christiania - a partially self-governing neighborhood in the city of ...

This page was created in 24.9 ms