Factoring: a method for scheduling parallel loops
Communications of the ACM
Allocating independent tasks to parallel processors: an experimental study
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Simgrid: A Toolkit for the Simulation of Application Scheduling
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
RUMR: Robust Scheduling for Divisible Workloads
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
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.