A doubling scheduler uses a prioritized round$-$robin scheduling policy. New processes are assigned an initial quantum of length R$.$ Whenever a process uses its entire quantum without blocking, its new quantum is set to twice its current quantum $(2*$R$).$ If a process blocks before its quantum expires, its new quantum is reset to R$.$ For the purposes of this question, assume that every process requires a finite total amount of CPU time. If the scheduler gives higher priority to processes that have smaller quanta.

 Is starvation possible in this system? Explain briefly. 

Answer rating: 100% (QA)

Starvation in operating systems refers to a situation where a process is unable to get the resources ... View the full answer