Round Robin Scheduling Based on Remaining Time and Median (RR_RT&M) for Cloud Computing

Abstract

Cloud computing is a system that is flexible to adjust infrastructure as needed with low costs. Quality of service is a challenge for a cloud service provider. A scheduling algorithm has a direct impact on the quality of service in cloud computing. Therefore, this work focuses on studying scheduling algorithms for cloud environments and proposes a new algorithm based on a round robin algorithm called round robin based on remaining time and median (RR_RT&M). It is compared with other algorithms, such as first-come, first-served (FCFS), and smarter round robin (SRR) algorithms. The performance metrics are makespan, execution time, and waiting time. The experiments were conducted in CloudSim simulator, and the results showed that RR_RT&M performed the best for all metrics and the percentage of improvement for makespan was between 16 and 72%. For execution time and waiting time, the improvement percentages were 31–73 and 0–73%, respectively.