AN IMPROVED REVAMPED MEAN ROUND ROBIN ALGORITHM BASED ON DYNAMIC TIME QUANTUM FOR IMPROVING RESOURCE ALLOCATION IN CLOUD COMPUTING

Subject Area: Scheduling Algorithm

The Revamped Mean Round Robin (RMRR) CPU scheduling algorithm is an impartial scheduling algorithm that gives same time quantum to all processes. However RMRR algorithm was not build to be implemented in cloud computing environment; In addition, it context switching is not at it minimal, due to the way it preempted and time quantum selected, even though this two aforementioned processes are (preempted and the time quantum) are very critical as it affects the algorithm’s performance. In this research, a new algorithm that improved the RMRR CPU scheduling algorithm was presented, and tailored towards efficient resource allocation in cloud computing environment. The New RMRR algorithm was implemented and compared with revamped mean round robin, New Improved Round Robin, Improved Round robin with Varying Quantum-Time and the developed algorithm, considering Average Waiting Time (AWT), Average Turnaround Time (ATAT), and Number of Context Switches (NCS) as performance measurement parameters. The result of the new RMRR technique reported a minimal AWT, improves on ATAT and better than the existing systems. Also modification was made on the improved algorithm to enable implementation on cloud environment. Built on these results, recommendations are made for the adoption of the new RMRR CPU algorithm over other scheduling algorithms for quality of service optimization in cloud computing environment.