Dynamic priority scheduling
 | This article needs attention from an expert on the subject. Please add a reason or a talk parameter to this template to explain the issue with the article. |
Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system.
Earliest deadline first scheduling and Least slack time scheduling are examples of Dynamic priority scheduling algorithms.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |