Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm

Download Now
Provided by: International Journal of Computer Applications
Topic: Software
Format: PDF
Process scheduling using round robin algorithm makes use of a fixed amount of time quantum that is assigned to each process to complete its execution. If the process is able to complete its execution within this time period, it is discarded from the ready queue otherwise it goes back to the rear of the ready queue and waits for its next turn. In this paper, the authors have presented amelioration to the conventional round robin algorithm by evaluating the time quantum on the basis of the burst times of the various processes waiting in the ready queue.
Download Now

Find By Topic