Title: Versatile time-cost algorithm (VTCA) for scheduling non-preemptive tasks of time critical workflows in cloud computing systems

Authors: L.D. Dhinesh Babu; P. Venkata Krishna

Addresses: School of Information Technology and Engineering, VIT University, Vellore – 632014, Tamil Nadu, India ' School of Computing Science and Engineering, VIT University, Vellore – 632014, Tamil Nadu, India

Abstract: In cloud computing environments, resources and infrastructure are provided as a service over internet on demand. The users are interested in reducing the service cost provided by the cloud service providers. Scheduling tasks of workflows play a vital role in determining performance of cloud computing systems. Workflows have many tasks in it and are interdependent on each other. Time critical workflows comprise of a collection of tasks which should be completed as early as possible so that other workflows get its turn. The budget involved in executing the time critical tasks is very high. The execution cost increases whenever we try to reduce the execution time. In this paper, we propose a method called versatile time-cost algorithm (VTCA) to schedule time critical workflows with minimum cost. VTCA will schedule the tasks to complete in earliest possible time as well as optimise the cost involved in resource provisioning. The results of experiments conducted using CloudSim simulator show that our scheduling policy minimises the completion time of workflows than other existing algorithms like min-min and fair max-min by 5% to 30% and it also reduces the costs by 5% to 35%.

Keywords: cloud computing; makespan minimisation; dependent task scheduling; time critical workflows; time-cost scheduling; non-preemptive tasks; simulation.

DOI: 10.1504/IJCNDS.2013.057718

International Journal of Communication Networks and Distributed Systems, 2013 Vol.11 No.4, pp.390 - 411

Received: 20 Aug 2012
Accepted: 25 Nov 2012

Published online: 21 Nov 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article