Performance comparison of priority rule scheduling algorithms using different inter arrival time jobs in grid environment

Abstract

Recent advancement in meta-heuristics grid scheduling studies have applied various techniques such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Ant Colony Optimization (ACO) to solve the grid scheduling problem. All of these technique requires an initial scheduler in order to initiate the scheduling process and the priority rule algorithms will typically be used. However, from the literature, none of these studies elaborate and justify their selection of a particular priority rule algorithms over another. Since the initial scheduler can significantly affect the entire scheduling process, it is important that the correct initial scheduler be selected. In this paper we quantitatively compared six initial scheduler algorithms to determine the best algorithm performance. We believe the performance comparison would enable users to utilize the best initial scheduler to fit their meta-heuristics grid scheduling studies.