Heuristic Task Allocation Strategies for Computational Grid

Abstract

Task allocation in computational grid is NP complete. Heuristic techniques have been widely used by the researchers to solve task allocation problem in grid computing. In this paper we survey heuristic based task allocation strategies and their efficiency. This strategy optimizes various performance parameters such as makespan, resource utilization, response time, workload balancing, service reliability, fairness deviation and throughput. A task life cycle model has been suggested in computational grid. We have also proposed a classification of heuristic task allocation strategies for computational grid.