Adaptive multi-round scheduling strategy for divisible workloads in grid environments

Scheduling is the key to divisible workload execution. UMR (Uniform Multi-Round) algorithm potentially performs near optimal by improving overlap of communication and computation. However, it is questioned how a static schedule works effectively in dynamic grid environment. The paper proposes an adaptive divisible workload scheduling system, which can adjust the schedule in a proactive way. An adaptive UMR-based multi-round algorithm (called AUMR) is presented and evaluated. In AUMR, if the run-time resource monitor notifies the scheduler of any resource changes, the scheduler will evaluate its impact and adjust the schedule if necessary. The experiment results show a considerable performance improvement by AUMR in dynamic grid environment.

[1]  Henri Casanova,et al.  Multiround algorithms for scheduling divisible loads , 2005, IEEE Transactions on Parallel and Distributed Systems.

[2]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[3]  Henri Casanova,et al.  Simgrid: a toolkit for the simulation of application scheduling , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[4]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

[5]  Torben Hagerup,et al.  Allocating Independent Tasks to Parallel Processors: An Experimental Study , 1996, J. Parallel Distributed Comput..

[6]  Henri Casanova,et al.  RUMR: robust scheduling for divisible workloads , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[7]  Henri Casanova,et al.  UMR: a multi-round algorithm for scheduling divisible workloads , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[8]  Edith Schonberg,et al.  Factoring: a method for scheduling parallel loops , 1992 .

[9]  Debasish Ghose,et al.  Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems , 2004, Cluster Computing.

[10]  HagerupTorben Allocating Independent Tasks to Parallel Processors , 1997 .