Design of Dependable Task Scheduling Algorithm in Cloud Environment

Abstract

Cloud computing is a very emerging technology now a days and has a lot of research in various areas like resource allocation, virtual machine (VM) allocation, task scheduling, security, privacy, etc. A large number of requests arrive in cloud every time; it is necessary to manage these requests which contains some independent and some dependent tasks. Dependent tasks causes delay in execution to other tasks so requires a heuristic approach for scheduling. In this paper we have proposed a new heuristic algorithm for dependable task scheduling which will reduce the period of scheduling and compared the results with Bounded Number of Processors (BNP) class of scheduling algorithms- Modified Critical Path (MCP), Earliest Time First (ETF) and Dynamic Level Scheduling (DLS). The results show less makespan, high speedup and low scheduling length ratio.