Performance Evaluation of Scheduling Algorithms Using CloudSim
摘要
Cloud computing is a growing method for using online resources, with varying traffic levels. Scheduling algorithms are crucial due to factors like execution time and latency. This paper examines cloud environments, highlighting models like SaaS, PaaS, IaaS, and types such as public, private, and hybrid. It uses CloudSim to simulate components like data centers and VMs. The study analyzes scheduling algorithms: FCFS, SJF, and RR. Results indicate SJF excels in most areas but not in makespan, FCFS fares well in makespan but is costly, and RR is efficient in makespan but slow in total completion time.