Time-Cost Efficient Scheduling Algorithms for Executing Workflow in Infrastructure as a Service Clouds

Abstract

Cloud Computing enables delivery of IT resources over the Internet and follows the pay-as-you-go billing model. The cloud infrastructures can be used as an appropriate environment for executing of workflow applications. To execute workflow applications in this environment, it is necessary to develop the workflow scheduling algorithms that consider different QoS parameters such as execution time and cost. Therefore, in this paper we focus on two criteria: total completion time (makespan) and execution cost of workflow, and propose two heuristic algorithms: MTDC (Minimum Time and Decreased Cost) which aims to create a schedule that minimizes the makespan and decreases execution cost, and CTDC (Constrained Time and Decreased Cost) which is based on the first algorithm (MTDC) and aims to create a schedule that decreases the execution cost while satisfying the deadline constraint of the workflow application. The proposed algorithms are evaluated by a simulation process using WorkflowSim. To evaluate the proposed algorithms, the results of MTDC are compared with the results of HEFT (Heterogeneous Earliest Finish Time), and the results of CTDC are compared with the results of heuristic based algorithms [such as IC-PCP (IaaS Cloud Partial Critical Paths), IC-PCPD2 (Deadline Distribution) and BDHEFT (Budget and Deadline HEFT)] and meta-heuristic based algorithms [such as PSO (Particle Swarm Optimization) and CGA2 (Coevolutionary Genetic Algorithm with Adaptive penalty function)]. The results show that the proposed algorithms perform better than the mentioned algorithms in most cases.