- Abstract:
- We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, which are already by their nature heterogeneous, can be expected to vary dynamically, even during the course of an execution. Typical scheduling methods in the literature partially address this issue because they consider static heterogenous computing environments (i.e. heterogeneous resources are dedicated and unchanging over time). This paper presents the Grid Task Positioning GTP scheduling method, which addresses the problem by allowing rescheduling of an executing application in response to significant variations in resource characteristics. GTP considers the impact of partial completion of tasks and task migration. We compare the performance of GTP with that of the well-known, and static, Heterogeneous Earliest Finish Time (HEFT) algorithm.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-1079,
- author = {
Israel Hernandez
and Murray Cole
},
- title = {Reactive Grid Scheduling of DAG applications},
- book title = {Parallel and Distributed Computing and Networks 2007},
- publisher = {ACTA Press},
- year = 2007,
- month = {Feb},
- pages = {92-97},
- url = {http://www.actapress.com/Abstract.aspx?paperId=29625},
- }
|