Scheduling DAGs on Grids with Copying and Migration
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.
KeywordsTask Graph Migration Cost Place Task Adaptive Version Exit Node
Unable to display preview. Download preview PDF.
- 1.Hernandez, I., Cole, M.: Reactive Grid Scheduling of DAG Applications. In: Proceedings of 25th IASTED (PDCN), pp. 92–97. Acta Press (2007)Google Scholar
- 2.Sakellariou, R., Zhao, H.: A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Scientific Prog. SPR 12(4), 253–262 (2004)Google Scholar
- 4.The Simgrid project, http://simgrid.gforge.inria.fr/
- 5.The Standard Graph Project, http://www.kasahara.elec.waseda.ac.jp/schedule/