DMCA
Task Scheduling Strategies for Workflow-based Applications in Grids (2005)
Cached
Download Links
- [www.cs.rice.edu]
- [www.isi.edu]
- [pegasus.isi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN CCGRID |
| Citations: | 108 - 16 self |
BibTeX
@INPROCEEDINGS{Blythe05taskscheduling,
author = {Jim Blythe and Sonal Jain and Ewa Deelman and Yolanda Gil and Karan Vahi and et al.},
title = {Task Scheduling Strategies for Workflow-based Applications in Grids},
booktitle = {IN CCGRID},
year = {2005},
pages = {759--767},
publisher = {IEEE Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing grid toolkits use matchmaking strategies that do not consider overall efficiency for the set of tasks to be run. We identify two families of resource allocation algorithms: task-based algorithms, that greedily allocate tasks to resources, and workflow-based algorithms, that search for an efficient allocation for the entire workflow. We compare the behavior of workflow-based algorithms and task-based algorithms, using simulations of workflows drawn from a real application and with varying ratios of computation cost to data transfer cost. We observe that workflow-based approaches have a potential to work better for data-intensive applications even when estimates about future tasks are inaccurate.
Keyphrases
task scheduling strategy workflow-based application task-based algorithm workflow-based algorithm workflow-based approach overall efficiency efficient execution data-intensive application large number efficient allocation heterogeneous task distributed resource grid toolkits computation cost good allocation future task transfer cost grid application entire workflow real application resource allocation algorithm
