Dynamic priority scheduling

From Wikipedia, the free encyclopedia

 This article or section is in need of attention from an expert on the subject.
Please help recruit one or improve this article yourself. See the talk page for details.
Please consider using {{Expert-subject}} to associate this request with a WikiProject

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.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.