Task scheduling strategies for workflow-based applications in grids

  • Authors:

  • J. Blythe;S. Jain;E. Deelman;Y. Gil;K. Vahi;A. Mandal;K. Kennedy

  • Affiliations:

  • UMIACS, Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;COPPE, Univ. Fed. do Rio de Janeiro, Brazil;COPPE, Univ. Fed. do Rio de Janeiro, Brazil;Dept. of Comput. Sci., Nat. Univ. of Ireland, Cork, Ireland;Software Eng. & Technol. Labs., Infosys Technol., Bangalore, India;Software Eng. & Technol. Labs., Infosys Technol., Bangalore, India

  • Venue:
  • CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.