Comparative analysis of task level heuristic scheduling algorithms in cloud computing

Cloud computing is a platform that provides many applications based on cloud infrastructure. It provides the facility of using different resources such as data storage, databases, networking, etc. The main problem in the cloud computing environment is task scheduling which plays an important role in optimizing the total execution time. In this paper, a comparison of scheduling algorithms such as First Come First Serve, Round Robin, min–min and max–min is done based on makespan using workflows as datasets. Comparison is done in by increasing the number of virtual machines Workflowsim environment. Experimental results show a decrease in makespan as the number of Virtual Machines is increased. For CyberShake workflow First Come First Serve algorithm has performed 3.69% better than Round Robin, outperformed 13.38% than min–min, and has given 22.68% better results than max–min. In the case of Montage workflow, max–min has performed 26.73% better than First Come First Serve, 17.73% than Round Robin, and has given 4.63% better results than min–min.