Header menu link for other important links
Enhanced round robin CPU scheduling with burst time based time quantum
Indusree J.R,
Published in IOP Publishing
Volume: 263
Issue: 4
Process scheduling is a very important functionality of Operating system. The main-known process-scheduling algorithms are First Come First Serve (FCFS) algorithm, Round Robin (RR) algorithm, Priority scheduling algorithm and Shortest Job First (SJF) algorithm. Compared to its peers, Round Robin (RR) algorithm has the advantage that it gives fair share of CPU to the processes which are already in the ready-queue. The effectiveness of the RR algorithm greatly depends on chosen time quantum value. Through this research paper, we are proposing an enhanced algorithm called Enhanced Round Robin with Burst-time based Time Quantum (ERRBTQ) process scheduling algorithm which calculates time quantum as per the burst-time of processes already in ready queue. The experimental results and analysis of ERRBTQ algorithm clearly indicates the improved performance when compared with conventional RR and its variants. © Published under licence by IOP Publishing Ltd.
About the journal
JournalData powered by TypesetIOP Conference Series: Materials Science and Engineering
PublisherData powered by TypesetIOP Publishing
Open AccessYes