Computational Grid has been employed for solving complex and large computation-intensive problems with the help of geographically distributed, heterogeneous and dynamic resources. Job scheduling is a vital and challenging function of a computational Grid system. Job scheduler has to deal with many heterogeneous computational resources and to take decisions concerning the dynamic, efficient and effective execution of jobs. Optimization of the Grid performance is directly related with the efficiency of scheduling algorithm. To evaluate the efficiency of a scheduling algorithm, different parameters can be used, the most important of which are makespan and flowtime. In this paper, a very recent evolutionary heuristic algorithm known as Wind Driven Optimization (WDO) is used for efficiently allocating jobs to resources in a computational Grid system so that makespan and flowtime are minimized. In order to measure the efficacy of WDO, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are considered for comparison. This study proves that WDO produces best results.
DGBSA : A Batch Job Scheduling Algorithm with GA with regard to the Threshold Detector
