A variation of the round-robin scheduler is the regressive round-robin scheduler

Question

A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler assigns each process a time quantum and a priority. The initial value of a time quantum is 50 milliseconds. However, every time a process has been allocated the CPU and uses its entire time quantum (does not block for I/O), 10 milliseconds is added to its time quantum, and its priority level is boosted. (The time quantum for a process can be increased to a maximum of 100 milliseconds.) When a process blocks before using its entire time quantum, its time quantum is reduced by 5 milliseconds, but its priority remains the same. What type of process (CPU-bound or I/O-bound) does the regressive round-robin scheduler favor? Explain.

Explanation / Answer

A regressive round robin scheduler is favoring CPU bound process.The more
the perocess is run by CPU, the more time the process gets its priority also
gets boosted and less the time it gets on CPU, less is its quanta and its prority, a blocking process is not very much favored by this scheduler as a blocking process loses its quanta and priority both. It does not seem that whether I/O bound proces has much impact because
I/O bound process also does not block.It is actually not favoring the process which gets
blocked before their quanta.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

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