Loading...

Introduction of novel dispatching rules for grid scheduling algorithms

Rasooli, A ; Sharif University of Technology | 2008

423 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICCCE.2008.4580772
  3. Publisher: 2008
  4. Abstract:
  5. Grid scheduling problems are dynamic as the jobs and resources in the system vary overtime. The Rulebased scheduling algorithms are a new trend in grid scheduling which are applicable in dynamic grid environments; The arriving jobs waiting for execution is ordered according to a certain rule and they are dispatched for processing according to that order. Grid scheduling algorithms usually involve more than one objective function. In particular, it is not enough to minimize the Maximum completion time (Makespan) objective function without taking into consideration the lateness of the jobs (Tardiness). In this paper two novel dispatching rules are proposed that aims to minimize the maximum completion time of jobs (Makespan) and at the same time reduce the average lateness of these jobs (Tardiness). Furthermore, the proposed dispatching rules are combined with a local Tabu search algorithm that can be programmed to further optimize various grid scheduling objective functions. A complete set of comparison between the various combinations of techniques is presented based on simulation results obtained using Grid Sim. ©2008 IEEE
  6. Keywords:
  7. Laws and legislation ; Learning algorithms ; Scheduling ; Tabu search ; Technology ; Telecommunication networks ; Certain rule ; Communication engineering ; Completion time ; Dispatching rules ; Dynamic grids ; Grid scheduling ; Human developments ; International conferences ; Makespan ; Objective function ; Simulation results ; Tabu search algorithm ; Scheduling algorithms
  8. Source: International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development, Kuala Lumpur, 13 May 2008 through 15 May 2008 ; 2008 , Pages 1072-1078 ; 9781424416929 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4580772