Confluence 2012 - The Next Generation Information Technology Summit |
Foundation of Computer Science USA |
CONFLUENCE - Number 1 |
September 2012 |
Authors: Adeeba Jamal, Aiman Zubair |
a43fb49a-8233-4230-9653-82ded581dffd |
Adeeba Jamal, Aiman Zubair . A Varied Round Robin Approach using Harmonic Mean of the Remaining Burst Time of the Processes. Confluence 2012 - The Next Generation Information Technology Summit. CONFLUENCE, 1 (September 2012), 12-17.
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. Here, in this paper we have put forth an approach which will vanquish the challenge which the conventional round robin faces.