Consider the following preemptive priority scheduling algorithms based on…
Consider the following preemptive priority scheduling algorithms based on dynamically changing priorities. Large priority numbers imply higher priority. When the process is waiting for the CPU in ready queue, its priority changes at a rate 'α'; when it's running, its priority changes at a rate 'β'. All processes are given same priority, when they enter the ready queue. Which one of the CPU scheduling algorithm results from α > β > 0 ?
- A.
Round Robin Algorithm
- B.
Shortest Job First Algorithm
- C.
Last-In-First-Out
- D.
First Come First Serve Algorithm
Attempted by 336 students.
Sign up free to check your answer
Sign up freeLoading lesson…

