Dynamic priority scheduling

From Wikipedia, the free encyclopedia

You have new messages (last change).
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

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

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

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../d/y/n/Dynamic_priority_scheduling.html"