Skip to main content

Comparison of Workflow Scheduling Strategies on the Grid

  • Conference paper
Book cover Parallel Processing and Applied Mathematics (PPAM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3911))

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.

The work described in this paper is supported by the European Union through the IST-2002-511385 project K-WfGrid.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blaha, P., Schwarz, K., Madsen, G., Kvasnicka, D., Luitz, J.: WIEN2k: An Augmented Plane Wave plus Local Orbitals Program for Calculating Crystal Properties. Institute of Physical and Theoretical Chemistry, Vienna University of Technology (2001)

    Google Scholar 

  2. The Austrian Grid Consortium, http://www.austriangrid.at

  3. Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Patil, S., Su, M.-H., Vahi, K., Livny, M.: Pegasus: Mapping scientific workflows onto the grid. In: European Across Grids Conference, pp. 11–20 (2004)

    Google Scholar 

  4. Rutschmann, P., Theiner, D.: An inverse modelling approach for the estimation of hydrological model parameters. Journal of Hydroinformatics (2005)

    Google Scholar 

  5. Duan, R., Fahringer, T., Prodan, R., Qin, J., Villazon, A., Wieczorek, M.: Real World Workflow Applications in the Askalon Grid Environment. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds.) EGC 2005. LNCS, vol. 3470, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. GT 4.0 Security website, http://www.globus.org/toolkit/docs/4.0/security/

  7. Nabrzyski, J., Schopf, J.M., Weglarz, J.: Grid Resource Management, State of the Art and Future Trends, pp. 99–116. Kluwer, Dordrecht (2003)

    MATH  Google Scholar 

  8. Prodan, R., Fahringer, T.: Dynamic Scheduling of Scientific Workflow Applications on the Grid using a Modular Optimisation Tool: A Case Study. In: 20th Symposion of Applied Computing (SAC 2005), Santa Fe, New Mexico, USA, March 2005, ACM Press, New York (2005)

    Google Scholar 

  9. Sakellariou, R., Zhao, H.: A hybrid heuristic for dag scheduling on heterogeneous systems. In: IPDPS (2004)

    Google Scholar 

  10. The Condor Team. Dagman (directed acyclic graph manager), http://www.cs.wisc.edu/condor/dagman/

  11. Qin, J., Fahringer, T., Hainzer, S.: Specification of Grid Workflow Applications with AGWL: An Abstract Grid Workflow Language. In: Proceedings of IEEE International Symposium on Cluster Computing and the Grid 2005 (CCGrid 2005), Cardiff, UK, May 9-12, 2005, IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  12. Zhao, H., Sakellariou, R.: An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 189–194. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/11752578_95

Download citation

  • DOI: https://doi.org/10.1007/11752578_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

  • Online ISBN: 978-3-540-34142-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics