Skip to main content

Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability

  • Conference paper
Book cover Algorithms and Architectures for Parallel Processing (ICA3PP 2010)

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

  • 1833 Accesses

Abstract

Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation. There are many well-designed scheduling algorithms proposed for heterogeneous computing systems. However, the availability variation is seldom considered in developing scheduling ongoing applications on a grid. In this paper, a scheduling algorithm called AROF is proposed. It considers availability variation as well as resource heterogeneity while scheduling applications to the grids. An experiment has been conducted to demonstrate that AROF algorithm outperforms the well-known scheduling algorithms Modified HEFT and GS in most of the cases.

This research is supported by National Science Council under the grant 98-2221-E-197-014.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baskiyar, S., SaiRanga, P.C.: Scheduling Directed A-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule Length. In: Proc. The Int’l Conf. Parallel Processing Workshops, pp. 97–103 (2003)

    Google Scholar 

  2. Cao, H., et al.: DAGMap: Efficient Scheduling for DAG Grid Workflow Job. In: The 9th IEEE/ACM Int’l Conf. Grid Computing, pp. 17–24 (2008)

    Google Scholar 

  3. Carter, B.R., et al.: Generational Scheduling for Dynamic Task Management in Heterogeneous Computing Systems. J. Information Sciences series 106, 219–236 (1998)

    Article  Google Scholar 

  4. Chang, J.-Y., Chen, H.-L.: Dynamic-Grouping Bandwidth Reservation Scheme for Multimedia Wireless Networks. IEEE J. Selected Areas in Communications 21, 1566–1574 (2003)

    Article  Google Scholar 

  5. Freund, R.F., et al.: Scheduling Resources in Multi-user, Heterogeneous, Computing Environments with SmartNet. In: Proc. Heterogeneous Computing Workshop, pp. 184–199 (1998)

    Google Scholar 

  6. Ilavarasan, E., Thambidurai, P., Mahilmannan, R.: Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System. In: Proc. The 4th Int’l Symp. Parallel and Distributed Computing, pp. 28–38 (2005)

    Google Scholar 

  7. Kwok, Y.-K., Ahmad, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. Parallel and Distributed Systems series 7, 506–521 (1996)

    Article  Google Scholar 

  8. de O. Lucchese, F., et al.: An Adaptive Scheduler for Grids. J. Grid Computing series 4, 1–17 (2006)

    Google Scholar 

  9. Maheswaran, M., et al.: Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing System. J. Parallel and Distributed Computing 59, 107–131 (1999)

    Article  Google Scholar 

  10. Rauber, T., Rünger, G.: Anticipated Distributed Task Scheduling for Grid Environments. In: Proc. The 20th Int’l Parallel and Distributed Processing Symposium (2006)

    Google Scholar 

  11. Sakellariou, R., Zhao, H.: A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In: Proc. The 18th Int’l Parallel and Distributed Processing Symposium (2004)

    Google Scholar 

  12. Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. Parallel and Distributed Systems series 13, 260–274 (2003)

    Google Scholar 

  13. Wang, L., et al.: Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach. J. Parallel and Distributed Computing series 47, 8–22 (1997)

    Article  Google Scholar 

  14. Wu, M.-Y., Gajski, D.D.: Hypertool: A Programming Aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems 1, 330–343 (1990)

    Article  Google Scholar 

  15. Yang, M., et al.: An End-to-End QoS Framework with On-Demand Bandwidth Reconfiguration. Computer Communications series 28, 2034–2046 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, CC., Hsu, CH. (2010). Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13119-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13118-9

  • Online ISBN: 978-3-642-13119-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics