Download Now Free registration required
A conventional round robin is a distinctive approach to the CPU scheduling algorithm. It is somehow related to the First Come First Serve approach with preemption included to give a fair chance to all the processes to execute waiting in the ready queue. A fixed time period known as time quantum is defined. The predominant round robin is an impartial algorithm since each process is given a fair share to complete its execution on its chance. No process is apportioned the CPU for more than one time quantum, so even if a fraction of time is remaining for a process to conclude its execution, the process is directed back to the ready queue and has to wait for its turn.
- Format: PDF
- Size: 488.25 KB