The outlook for cloud computing is growing day by day. It is a developing field which is evolving and giving new ways to build, manage, and process data. The most difficult task in cloud computing is to provide best quality parameters like maintaining deadline, minimizing make-span time, increasing utilization of resources, etc. Therefore, dynamic scheduling of algorithm is needed by a service provider that executes the task within given time span while reducing make-span time. The proposed algorithm utilizes merits of max min, round robin, and min-min and tries to remove the demerits of them. The proposed algorithm has been simulated in Cloud Sim by varying number of tasks, and analysis has been made based on make-span, average utilization of resources, and balancing of load. The results show that the proposed technique has better results as compared to heuristic techniques such as min-min, round robin, and max-min.
展开▼
