Makespan Optimization Algorithm for Scheduling in Grids

Abstract

Grid Computing is a service aggregation of information and computational resources. To manage these resources efficiently a grid resource management system is required. Due to dynamicity and hetrogenity of resources as well as grid applications scheduling becomes challenging. This thesis proposes a efficient scheduling algorithm which aims to optimize makespan. The proposed algorithm is implemented using DAG approach and comparative results show that it optimizes makespan.