Hill Climbing-Based Decentralized Job Scheduling on Computational Grids

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

[1]  Muthucumaru Maheswaran,et al.  Distributed dynamic scheduling of composite tasks on grid computing systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2]  P. Sadayappan,et al.  Distributed job scheduling on computational Grids using multiple simultaneous requests , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[3]  Dror G. Feitelson,et al.  Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling , 2001, IEEE Trans. Parallel Distributed Syst..

[4]  Dror G. Feitelson,et al.  The workload on parallel supercomputers: modeling the characteristics of rigid jobs , 2003, J. Parallel Distributed Comput..

[5]  Uwe Schwiegelshohn,et al.  On Advantages of Grid Computing for Parallel Job Scheduling , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[6]  Kavitha Ranganathan,et al.  Decoupling computation and data scheduling in distributed data-intensive applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[7]  Sajal K. Das,et al.  A de-centralized scheduling and load balancing algorithm for heterogeneous grid environments , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[8]  Subhash Saini,et al.  Agent-based grid load balancing using performance-driven task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[9]  P. Sadayappan,et al.  Characterization of backfilling strategies for parallel job scheduling , 2002, Proceedings. International Conference on Parallel Processing Workshop.