Hill Climbing-Based Decentralized Job Scheduling on Computational Grids

  • Authors:
  • Qingjiang Wang;Yun Gao;Peishun Liu

  • Affiliations:
  • Ocean University of China, China;Ocean University of China, China;Ocean University of China, China

  • Venue:
  • IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 1 (IMSCCS'06) - Volume 01
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

De-centralized job scheduling is implemented by job migrations between neighboring grid nodes. To optimize node selection of a new-submitted job, the job may be migrated many times. Here, the hill climbing method is used to determine the migration route. Experiments simulate de-centralized job scheduling, including node adjacencies, local scheduling of grid nodes, and grid workload. Compared with k-distributed and auction methods, hill climbing-based scheduling usually can enhance processor utilization, and can reduce bounded slowdown.