Comparative Performance Analysis of Even Odd Round Robin Scheduling Algorithm (EORR) Using Dynamic Time Quantum With Round Robin Scheduling Algorithm Using Static Time Quantum
Source: International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
In the Round-Robin scheduling scheme, the scheduler processes each job, one after another, after giving a preset quantum of time. It is a preemptive CPU scheduling algorithm which switches between the processes when static time quantum expires. Round Robin scheduling algorithm is designed especially for time sharing operating system but it has its disadvantages that are its Longer Average Waiting Time, Higher Context Switches and Higher Turnaround Time. In this scheduling algorithm the main idea is to adjust the time quantum dynamically so that (EORR) perform better performance than Round Robin scheduling algorithm.