A Novel Approach of Task Scheduling in Cloud Computing Environment

Abstract

The recent era of technology is rapidly increasing with cloud environment, and it is just nothing but Internet computing via Internet technology. The demand of cloud computing is everywhere such as healthcare, physics, online marketing and so on. Scheduling problem is referred as NP-complete, and it is basically, allocation of the tasks in the available virtual machines. The primary objective of any task scheduling approach is to reduce the overall execution time. This paper presents an algorithm which is based on two steps process such as first step, to find the minimum value of all the tasks between entry task(s) and all nonentry tasks and to sort the tasks as per minimum value. This is basically used for priority of the tasks. Secondly, to allocate the tasks on available virtual machines. Proposed algorithm is tested on two different DAGs with ten tasks and fifteen tasks which gives better scheduling length as compared to heuristic algorithm such as HEFT algorithm.