Jump to content

Dynamic priority scheduling

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 169.71.50.36 (talk) at 08:49, 19 December 2006 (correct spelling of "which"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

It's a type of Scheduling Algorithm in which the priorities are calculated during the execution of the system.

Earliest deadline first scheduling is an example of a Dynamic priority scheduling algorithm.