Comparison of Workflow Scheduling Strategies on the Grid

  • Marek Wieczorek
  • Radu Prodan
  • Thomas Fahringer
Conference paper

DOI: 10.1007/11752578_95

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)
Cite this paper as:
Wieczorek M., Prodan R., Fahringer T. (2006) Comparison of Workflow Scheduling Strategies on the Grid. In: Wyrzykowski R., Dongarra J., Meyer N., Waśniewski J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg

Abstract

Scheduling is a key concern for the execution of performance-driven Grid applications. In this paper we comparatively examine different existing approaches for scheduling of scientific workflow applications in a Grid environment. We evaluate three algorithms namely genetic, HEFT, and simple “myopic” and compare incremental workflow partitioning against the full-graph scheduling strategy. We demonstrate experiments using real-world scientific applications covering both balanced (symmetric) and unbalanced (asymmetric) workflows. Our results demonstrate that full-graph scheduling with the HEFT algorithm performs best compared to the other strategies examined in this paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Marek Wieczorek
    • 1
  • Radu Prodan
    • 1
  • Thomas Fahringer
    • 1
  1. 1.Institute of Computer ScienceUniversity of InnsbruckInnsbruckAustria

Personalised recommendations