Design and Evaluation of CPU Scheduling Algorithms Based on Relative Time Quantum: Variations of Round Robin Algorithm

摘要

Despite advancements in computing resources, resource optimization is still a relevant research domain. Advent of cloud computing environments and big data applications require optimized computing resource usage, as a result traditional approaches of process scheduling need to be further improved. In this paper, we present two variations of round robin CPU scheduling algorithm, where time quantum is calculated by averaging the process burst time for each half of the list and then applying addition and subtraction to the relative values. The simulation results highlight that performance of these modified algorithms has significantly improved as compared to traditional round robin algorithm.