Makespan Minimization Using WQACO Algorithm

Abstract

Grid computing, a next leap in communication technology, a new trend in distributed computing system that enables utilization of idle resources existing worldwide, to solve data intensive and computationally intensive problems. The resources may either be homogeneous or heterogeneous in nature and they are shared from multiple administrative domains. The problem is divided into independent tasks and the tasks are executed by the resources available in grid. Scheduling these tasks to various resources in a grid is a very important problem and it is NP Complete. Hence we need a good task scheduling strategy to utilize the grids effectively such that make span is minimized. In literature, many heuristic approaches for scheduling are available that give near optimal solution. In this paper we propose a weighted QoS factor enabled ant colony algorithm for scheduling independent tasks on heterogeneous grid resources. The main contributions of our work are to minimize the makespan with Qos satisfaction and the results are compared with max-min and min-min algorithm.