Earliest deadline first scheduling
See also: EDF (homonymy)
Earliest deadline first scheduling is an algorithm of préemptif Ordonnancement at dynamic priority used in the systems real-time. It allots a priority to each request according to the expiry of the latter. The closer the expiry of a task is, plus its priority is large. In this manner, as fast as possible work must be carried out, with more it is likely to be carried out. This algorithm is optimal for all types of system of tasks, however, it is rather difficult to implement and is thus used little. Moreover, it does not envisage any compromise " satisfaisant" in the event of overload of the system (utilization ratio higher than 100%); its establishment is thus a little hazardous in the industrial systems real-time.
|Random links:||Mount-under-Vaudrey | SXW | Constellation of prime numbers | Phoebetria palpebrata | Dominique de Legge | Comté_cherokee,_Alabama|