Skip to main content
Log in

A Launch-time Scheduling Heuristics for Parallel Applications on Wide Area Grids

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

Abstract

Large and dynamic computational Grids, generally known as wide-area Grids, are characterized by a large availability, heterogene- ity on computational resources, and high vari- ability on their status during the time. Such Grid infrastructures require appropriate schedule mechanisms in order to satisfy the application performance requirements (QoS). In this paper we propose a launch-time heuristics to schedule component-based parallel applications on such kind of Grid. The goal of the proposed heuristics is threefold: to meet the minimal task computation- al requirement, to maximize the throughput between communicating tasks, and to evaluate on-the-fly the resource availability to minimize the aging effect on the resources state. We evaluate the proposed heuristics by simulations applying it to a suite of task graphs and Grid platforms randomly generated. Moreover, a further test was conducted to schedule a real application on a real Grid. Experimental results shown that the proposed solution can be a viable one.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adams, R., Bischof, L.: Seeded region growing. IEEE Trans. Pattern Anal. Mach. Intell. 16(6), 641–647 (1994)

    Article  Google Scholar 

  2. Ahmad, I., Kwok, Y.-K.: On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Syst. 9(9), 872–892 (1998)

    Article  Google Scholar 

  3. Allcock, B., Bester, J., Bresnahan, J., Chervenak, A.L., Foster, I., Kesselman, C., Meder, S., Nefedova, V., Quesnel, D., Tuecke, S.: Data management and transfer in high-performance computational Grid environments. Parallel Comput. 28(5), 749–771 (2002)

    Article  Google Scholar 

  4. Berman, F., Wolski, R., Casanova, H., Cirne, W., Dail, H., Faerman, M., Figueira, S., Hayes, J., Obertelli, G., Schopf, J., Shao, G., Smallen, S., Spring, N., Su, A., Zagorodnov, D.: Adaptive computing on the Grid using apples. IEEE Trans. Parallel Distrib. Syst. 14(4), 369–382 (2003)

    Article  Google Scholar 

  5. Bowen, N.S., Nikolaou, C.N., Ghafoor, A.: On the assignment problem of arbitrary process systems to heterogeneous distributed computer systems. IEEE Trans. Comput. 41(3), 257–273 (1992)

    Article  Google Scholar 

  6. Cabri-graphs: IMAG. http://www-cabri.imag.fr/CabriGraphes/ (1998)

  7. Carter, B.R., Watson, D.W., Freund, R.F., E. K., Mirabile, F., Siegel, H.J.: Generational scheduling for dynamic task management in heterogeneous computing systems. Inf. Sci. 106(3,4), 219–236 (1998)

    Article  Google Scholar 

  8. Choe, T.-Y., Park, C.-I.: A task duplication based scheduling algorithm with optimality condition in heterogeneous systems. In: Proceedings of the 14th International Parallel and Distributed Processing Symposium. Washington, DC, USA (2000)

  9. Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid information services for distributed resource sharing. In: Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing. Washington, DC, USA (2001)

  10. Dail, H., Sievert, O., Berman, F., Casanova, H., YarKhan, A., Vadhiyar, S., Dongarra, J., Liu, C., Yang, L., Angulo, D., Foster, I.: Scheduling in the Grid application development software project. In: Resource Management in the Grid. Hingham, MA, USA (2003)

  11. de O. Lucchese, F., Yero, E.J.H., Sambatti, F.S., Henriques, M.A.A.: An adaptive scheduler for Grids. Journal of Grid Computing V4(1), 1–17 (2006)

  12. Demaine, E., Immorlica, N.: Correlation clustering with partial information. In: Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Berlin, Germany (2003)

  13. den Burger, M., Kielmann, T., Bal, H.: TOPOMON: A monitoring tool for Grid network topology. In: Proceedings of the International Conference on Computational Science. Berlin, Germany (2002)

  14. Doar, M.: A better model for generating test networks (1996)

  15. Eshaghian, M.M.: Heterogeneous computing. Artech House, Norwood, MA, USA (1996)

    Google Scholar 

  16. Foster, I., Kesselman, C.: The globus project: a status report. Future Gener. Comput. Syst. 15(5,6), 607–621 (1999a)

    Article  Google Scholar 

  17. Foster, I., Kesselman, C.:The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA, USA (1999b)

    Google Scholar 

  18. Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: enabling scalable virtual organizations. Int. J. Supercomput. Appl. 15(3), 200–222 (2001)

    Article  Google Scholar 

  19. INRIA: ProActive. http://www-sop.inria.fr/oasis/ProActive (1999)

  20. Iverson, M., Ozguner, F., Follen, G.: Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of the 4th Heterogeneous Computing Workshop (1995)

  21. Krauter, K., Buyya, R., Maheswaran, M.: A taxonomy and survey of Grid resource management systems for distributed computing. Software Practice and Experience 32(2), 135–164 (2002)

    Article  MATH  Google Scholar 

  22. Li, H., Groep, D., Wolters, L.: Workload characteristics of a multi-cluster supercomputer. In: Proceedings of the 10th Workshop on Job Scheduling Strategies for Parallel processing. Berlin, Germany (2004)

  23. Lo, V.M.: Heuristic algorithms for task assignment in Distributed Systems. IEEE Trans. Comput. 37(11), 1384–1397 (1988)

    Article  MathSciNet  Google Scholar 

  24. Raman, R., Livny, M., Solomon, M.: Matchmaking: an extensible framework for distributed resource management. Cluster Comput. 2(2), 129–138 (1999)

    Article  Google Scholar 

  25. Schopf, J.M.: General Architecture for Scheduling on the Grid. Technical report, Argonne National Laboratory (2002)

  26. Sinnen, O., Sousa, L.: A classification of graph theoretic models for parallel computing. Technical report, Instituto Superior Tecnico, Technical University of Lisbon, Portugal (1999)

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

    Article  Google Scholar 

  28. Vadhiyar, S., Dongarra, J.: A metascheduler for the Grid. In: Proceedings of the Eleventh IEEE International Symposium on High-Performance Distributed Computing. Washington, DC, USA (2002)

  29. Vanneschi, M.: The programming model of ASSIST, an environment for parallel and distributed portable applications. Parallel Comput. 28(12), 1709–1732 (2002)

    Article  MATH  Google Scholar 

  30. Wang, L., Siegel, H.J., Roychowdhury, V.R., Maciejewski, A.A.: Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. J. Parallel Distrib. Comput. 47(1), 8–22 (1997)

    Article  Google Scholar 

  31. Wolski, R., Spring, N.T., Hayes, J.: The network weather service: a distributed resource performance forecasting service for metacomputing. Future Gener. Comput. Syst. 15(5,6), 757–768 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicola Tonellotto.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baraglia, R., Ferrini, R., Tonellotto, N. et al. A Launch-time Scheduling Heuristics for Parallel Applications on Wide Area Grids. J Grid Computing 6, 159–175 (2008). https://doi.org/10.1007/s10723-006-9061-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-006-9061-5

Keywords

Navigation