previous | start | next

Priority Algorithms and Starvation

Scheduling priority can be either static or dynamic.

Static priority is assigned at process creation and does not change.

Dynamic priority may change during execution of a process.

A static priority scheduling algorithm may lead to starvation. In particular, continuing arrivals in READY of processes having higher priority than waiting processes in the READY could cause the lower priority waiting process to wait indefinitely; i.e., cause them to starve.



previous | start | next