Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A low-cost rescheduling policy for efficient mapping of workflows on grid systems
Scientific Programming - AxGrids 2004
Reactive grid scheduling of DAG applications
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Reliable DAG scheduling on grids with rewinding and migration
Proceedings of the first international conference on Networks for grid applications
| Hi-index | 0.00 |
Effective task scheduling mechanisms for Grids must address the dynamic and heterogeneous nature of the system by allowing rescheduling and migration of tasks in reaction to significant variations in resource characteristics. Migration may be invoked when the cost of the migration itself is outweighed by the global time saved due to execution at the new site. We extend our previous results in this area by considering the maintenance of a collection of reusable copies of the results of completed tasks. We show how to reuse such copies to improve overall application makespan. We present the Grid Task Positioning with Copying facilities GTP/c system. We compare the performance of GTP/c with our previous model GTP and DLS/sr, an adaptive version of the dynamic level scheduling static method.