Consider a preemptive priority scheduling algorithm based on dynamically changin

Question

Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue, but not running), its priority changes at a rate W; when it is running, its priority changes at a rate R. All processes are given a priority of 0 when they enter the ready queue. Different scheduling schemes can be derived by setting the parameters W and R to certain ways. Explain what will happen if W and R are set to some negative values with the condition W < R.

Explanation / Answer

The Scheduling will not be effected.

The Scheduling will only take into account the priorities and if by any chance any negative priority is assigned and if all other processes with positive priorities are running then it may starve.

So probably when any process enters into the queue it will be assigned some priority and it keeps on decreasing by an amount of W and the rate at which priorities are served is R then newly coming processes will definitely starve.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.