Skip to main content
SpringerLink
Log in

Scheduling DAGs on Grids with Copying and Migration

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2007)

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

  • 1141 Accesses

Abstract

Effective task scheduling mechanisms for Grids must address the dynamic and heterogeneous nature of the system by allowing rescheduling and migration of tasks in reaction to significant variations in resource characteristics. Migration may be invoked when the cost of the migration itself is outweighed by the global time saved due to execution at the new site. We extend our previous results in this area by considering the maintenance of a collection of reusable copies of the results of completed tasks. We show how to reuse such copies to improve overall application makespan. We present the Grid Task Positioning with Copying facilities GTP/c system. We compare the performance of GTP/c with our previous model GTP and DLS/sr, an adaptive version of the dynamic level scheduling static method.

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

Access this chapter

Log in via an institution
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. Hernandez, I., Cole, M.: Reactive Grid Scheduling of DAG Applications. In: Proceedings of 25th IASTED (PDCN), pp. 92–97. Acta Press (2007)

    Google Scholar 

  2. Sakellariou, R., Zhao, H.: A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Scientific Prog. SPR 12(4), 253–262 (2004)

    Google Scholar 

  3. Topcuoglu, H.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. Trans. Parallel Dist.Syst. 13(3), 260–274 (2002)

    Article  Google Scholar 

  4. The Simgrid project, http://simgrid.gforge.inria.fr/

  5. The Standard Graph Project, http://www.kasahara.elec.waseda.ac.jp/schedule/

  6. Sih, G., Lee, E.: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. Trans.Parallel Dist.Syst. 4(2), 175–187 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computing Systems Architecture School of Informatics, University of Edinburgh,  

    Israel Hernandez & Murray Cole

Authors
  1. Israel Hernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Murray Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roman Wyrzykowski Jack Dongarra Konrad Karczewski Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hernandez, I., Cole, M. (2008). Scheduling DAGs on Grids with Copying and Migration. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_108

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68111-3_108

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68105-2

  • Online ISBN: 978-3-540-68111-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation