Introduction of Novel Rule Based Algorithms for Scheduling in Grid Computing Systems

The rule based scheduling algorithms are a new trend in grid scheduling algorithms; the combination of rule based algorithms for resource selection with various dispatching rules for queuing of jobs can improve or deteriorate their performance. Thus, choosing a proper queuing strategy for each algorithm is a prominent issue in scheduling. In this paper, we introduce two new dispatching rules for resource selection and three new dispatching rules for queuing of jobs; we evaluate the performance of various combinations of these new rule based scheduling algorithms and queuing strategies. Also, we use some major combination of rule based scheduling algorithms with some important queuing strategies to verify the good results of these new algorithms. We introduce a set of criteria used to evaluate the grid scheduling algorithms.