Consider the following preemptive priority-scheduling algorithm that is based on
ID: 3631192 • Letter: C
Question
Consider the following preemptive priority-scheduling algorithm that is 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 A; when it is running, its priority changes at a rate B. All processes are given a priority of 0 when they enter the ready queue. The parameters A and B can be set to give many different scheduling algorithms.
What is the algorithm that results from B > A > 0? (FCFS)
What is the algorithm that results from A < B < 0? (LIFO)
What would be some other possibilties for setting the parameters A and B, and what would be the resulting scheduling algorithm?
Explanation / Answer
One of the others possibility is A>B>0 . It is time slicing or round robin scheduling.