Earliest deadline first scheduling

Earliest deadline first scheduling

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

Earliest deadline first (EDF) or least time to go is a dynamic priority scheduling algorithm used in real-time operating systems to place processes in a priority queue. Whenever a scheduling event occurs (task finishes, new task released, etc.) the queue will be searched for the process closest to its deadline.

Excerpt from the Wikipedia article “Earliest deadline first scheduling”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Earliest deadline first scheduling to your collection.

Play for free

Related cards