Skip to main content
SpringerLink
Log in

Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

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, two scheduling algorithms called AMOF and AMOSF are proposed. Both of them consider availability variation as well as resource heterogeneity while scheduling an ongoing workflow application on the grid. An experiment has been conducted to demonstrate that AMOF and AMOSF algorithms outperform the well-known scheduling algorithms: GS and HEFT in most of the cases.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baskiyar, S., SaiRanga, P.C.: Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length. In: Proceedings The Int’l Conference Parallel Processing Workshops, pp. 97–103 (2003)

  2. Cao, H., et al.: DAGMap: Efficient scheduling for DAG grid workflow job. In: The 9th IEEE/ACM Int’l Conference Grid Computing, pp. 17–24 (2008)

  3. Carter, B.R., et al.: Generational scheduling for dynamic task management in heterogeneous computing systems. J. Inf. Sci. 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. Sel. Areas Commun. 21, 1566–1574 (2003)

    Article  Google Scholar 

  5. Chung, Y., Ranka, S.: Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. Proc. Supercomputing, 512–521 (1992)

  6. Cuzzocrea, A., et al.: Approximate query answering on sensor network data streams, pp. 53–72. GeoSensor Networks, CRC Press (2004)

  7. Cuzzocrea, A., et al.: A Distributed System for Answering Range Queries on Sensor Network Data. In: Proceedings PerCom Workshops, pp. 369–373 (2005)

  8. Freund, R.F., et al.: Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet. In: Proceedings Heterogeneous Computing Workshop, pp. 184–199 (1998)

  9. Ilavarasan, E., Thambidurai, P., Mahilmannan, R.: Performance effective task scheduling algorithm for heterogeneous computing system. In: Proceedings The 4th Int’l Symposium Parallel and Distributed Computing, pp. 28–38 (2005)

  10. Kwok, Y.-K., Ahmad, I.: Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7, 506–521 (1996)

    Article  Google Scholar 

  11. de Lucchese, F.O., et al.: An adaptive scheduler for grids. J. Grid Comput. 4, 1–17 (2006)

    Article  Google Scholar 

  12. Maheswaran, M., et al.: Dynamic mapping of a class of independent tasks onto heterogeneous computing system. J. Parallel Distrib. Comput. 59, 107–131 (1999)

    Article  Google Scholar 

  13. Rauber, T., Rünger, G.: Anticipated distributed task scheduling for grid environments. In: Proceedings The 20th Int’l Parallel and Distributed Processing Symposium (2006)

  14. Sakellariou, R., Zhao, H.: A hybrid heuristic for DAG scheduling on heterogeneous systems. In: Proceedings The 18th Int’l Parallel and Distributed Processing Symposium (2004)

  15. Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13, 260–274 (2003)

    Article  Google Scholar 

  16. Wang, L., et al.: Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. J. Parallel Distrib. Comput. 47, 8–22 (1997)

    Article  Google Scholar 

  17. Wu, M.-Y., Gajski, D.D.: Hypertool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst. 1, 330–343 (1990)

    Article  Google Scholar 

  18. Yang, M., et al.: An End-to-End QoS framework with on-demand bandwidth reconfiguration. Comput. Commun. 28, 2034–2046 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, National Ilan University, Yilan City, Yilan County, Taiwan

    Cho-Chin Lin

  2. Academia Sinica, Institute of Information Science, Taipei City, Taiwan

    Chih-Hsuan Hsu & Tsan-sheng Hsu

Authors
  1. Chih-Hsuan Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cho-Chin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tsan-sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cho-Chin Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hsu, CH., Lin, CC. & Hsu, Ts. Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability. J Grid Computing 12, 447–463 (2014). https://doi.org/10.1007/s10723-014-9298-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-014-9298-3

Keywords

Search

Navigation