Scheduling strategies for mapping application workflows onto the grid

  • Authors:

  • Anirban Mandal;K. Kennedy;C. Koelbel;G. Marin;J. Mellor-Crummey;B. Liu;L. Johnsson

  • Affiliations:

  • Dept. of Comput. Sci., Rice Univ., Houston, TX, USA;Dept. of Comput. Sci., Rice Univ., Houston, TX, USA;Dept. of Comput. Sci., Rice Univ., Houston, TX, USA;Dept. of Comput. Sci., Rice Univ., Houston, TX, USA;Dept. of Comput. Sci., Rice Univ., Houston, TX, USA;-;-

  • Venue:
  • HPDC '05 Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, we describe new strategies for scheduling and executing workflow applications on grid resources using the GrADS [Ken Kennedy et al., 2002] infrastructure. Workflow scheduling is based on heuristic scheduling strategies that use application component performance models. The workflow is executed using a novel strategy to bind and launch the application onto heterogeneous resources. We apply these strategies in the context of executing EMAN, a bio-imaging workflow application, on the grid. The results of our experiments show that our strategy of performance model based, in-advance heuristic workflow scheduling results in 1.5 to 2.2 times better makespan than other existing scheduling strategies. This strategy also achieves optimal load balance across the different grid sites for this application.