Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of dynamic priority scheduling is to adapt to dynamically changing progress and form an optimal configuration in self-sustained manner. It can be very hard to produce well-defined policies to achieve the goal depends on difficulty of given problem.

Earliest deadline first scheduling

Earliest deadline first scheduling

Earliest deadline first or least time to go is a dynamic scheduling algorithm used in real-time operating systems. It places processes in a priority queue. Whenever a scheduling event occurs the queue will be searched for the process closest to its deadline...

 and Least slack time scheduling

Least slack time scheduling

Least Slack Time scheduling is a scheduling algorithm. It assigns priority based on the slack time of a process. Slack time is the amount of time left after a job if the job was started now. This algorithm is also known as Least Laxity First. Its most common use is in embedded systems, especially...

are examples of Dynamic priority scheduling algorithms.

Measurement on effectiveness of scheduling

The idea of dynamic priority scheduling is to confine focus on algorithms that assign priorities based on temporal parameters and maximize of resources utilization; This utilization measurement of a certain scheduling, called schedulable utilization, is scaled from 0 to 1, and the higher the schedulable utilization means the better algorithm. Every set of periodic tasks with total utilization less or equal than the schedulable utilization of an algorithm can be feasibly scheduled by that algorithm.