Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Please show work: In a Regressive Round Robin Scheduler, each process is assigne

ID: 3564119 • Letter: P

Question

Please show work:

In a Regressive Round Robin Scheduler, each process is assigned a time quantum and a priority. Initially the value of the time quantum is 50 milliseconds. Every time a process has been allocated the CPU and uses its entire time quantum, i.e., does not block for I/O, 10 milliseconds is added to the time quantum and its priority level is boosted. The time quantum 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 and the priority is left unchanged. What type of process, i.e., CPU bound or I/0 bound, does this regressive round robin scheduler favor? Explain your answer.

Explanation / Answer

Round-Robin scheduling tends to favor CPU bound processes over I/O bound ones.

Each process gets put back at the end of the queue no matter how much or how little of the quantum was used.

The time quantum and priority for CPU bound processes increases every time, when the process is allocated to the CPU.

I/O bound processes tend to run for a short period of time (because time quantum is reduced by 5 milliseconds and priority is left unchanged).

So, they might have to wait in the queue a long time.