Skip to main content

Advertisement

SpringerLink
Log in

A comparison of utility-oriented algorithms for scheduling parallel tasks in multi-cluster grid

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Scheduling parallel tasks in multi-cluster grid can be seen as two interdependent problems: cluster allocation and scheduling parallel task on the allocated cluster. In this paper both rigid and moldable parallel tasks are considered. We propose a theoretical model of utility-oriented parallel task scheduling in multi-cluster grid with advance reservations. On the basis of the model we present an approximation algorithm, a repair strategy based genetic algorithm and greedy heuristics MaxMax, T-Sufferage and R-Sufferage to solve the two interdependent problems. We compare the performance of these algorithms in aspect of utility optimality and timing results. Simulation results show on average the (1+α)-approximation algorithm achieves the best trade-off between utility optimality and timing. Genetic algorithm could achieve better utility than greedy heuristics and approximate algorithm at expensive time cost. Greedy heuristics do not perform equally well when adapted to different utility functions while the approximation algorithm shows its intrinsic stable performance.

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. Abawajy, J.H., Dandamudi, S.P.: Parallel job scheduling on multicluster computing systems. In: CLUSTER, pp. 11–18 (2003)

  2. Adamy, U., Erlebach, T., Mitsche, D., Schurr, I., Speckmann, B., Welzl, E.: Off-line admission control for advance reservations in star networks. In: WAOA, pp. 211–224 (2004)

  3. Aggarwal, M., Kent, R.D., Ngom, A.: Genetic algorithm based scheduler for computational grids. In: HPCS’05: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications, Washington, DC, USA, 2005, pp. 209–215. IEEE Computer Society, New York (2005)

    Chapter  Google Scholar 

  4. Bar-Noy, A., Bar-Yehuda, R., Freund, A., (Seffi) Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069–1090 (2001)

    Article  MathSciNet  Google Scholar 

  5. Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: A unified framework for approximation algorithms. In memoriam: Shimon even 1935–2004. ACM Comput. Surv. 36(4), 422–463 (2004)

    Article  Google Scholar 

  6. Braun, T.D., Siegel, H.J., Beck, N., Bölöni, L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D.A., Freund, R.F.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61(6), 810–837 (2001)

    Article  Google Scholar 

  7. Cohen, R., Katzir, L., Raz, D.: Scheduling algorithms for a cache pre-filling content distribution network. In: Infocom’2002 (2002)

  8. Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162–166 (2006)

    Article  MathSciNet  Google Scholar 

  9. Di Martino, V., Mililotti, M.: Sub optimal scheduling in a grid using genetic algorithms. Parallel Comput. 30(5–6), 553–565 (2004). Parallel and nature-inspired computational paradigms and applications

    Article  Google Scholar 

  10. Di Martino, V.: Sub optimal scheduling in a grid using genetic algorithms. In: IPDPS ’03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, Washington, DC, USA, 2003, p. 1.481. IEEE Computer Society, New York (2003)

    Google Scholar 

  11. Downey, A.B.: A model for speedup of parallel programs. Technical Report, Berkeley, CA, USA (1997)

  12. Frachtenberg, E., Schwiegelshohn, U.: New challenges of parallel job scheduling. In: JSSPP, pp. 1–23 (2007)

  13. Fujimoto, N., Hagihara, K.: Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid. In: ICPP, pp. 391–398 (2003)

  14. Golconda, K.S., Özgüner, F., Dogan, A.: A comparison of static qos-based scheduling heuristics for a meta-task with multiple qos dimensions in heterogeneous computing. In: IPDPS (2004)

  15. LHC Computing Grid http://lcg.web.cern.ch/LCG/

  16. He, L., Jarvis, S.A., Spooner, D.P., Chen, X., Nudd, G.R.: Dynamic scheduling of parallel jobs with qos demands in multiclusters and grids. In: GRID ’04: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, Washington, DC, USA, 2004, pp. 402–409. IEEE Computer Society, New York (2004)

    Google Scholar 

  17. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge (1992)

    Google Scholar 

  18. Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2), 331–342 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. LSF http://www.platform.com/Products/platform-lsf

  20. Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J. Parallel Distrib. Comput. 59, 107–131 (1999)

    Article  Google Scholar 

  21. MAUI http://www.clusterresources.com/products/maui-cluster-scheduler.php/

  22. Mestre, J.: Adaptive local ratio. In: SODA’08: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 152–160. Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics (2008)

  23. Michalewicz, Z.: A survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th Annual Conference on Evolutionary Programming, pp. 135–155. MIT Press, Cambridge (1995)

    Google Scholar 

  24. PBS http://www.openpbs.org/

  25. Raidl, G.R.: An improved genetic algorithm for the multiconstrained 0–1 knapsack problem. In: Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Conference on, pp. 207–211, May (1998)

  26. Sabin, G., Kettimuthu, R., Rajan, A.: Scheduling of parallel jobs in a heterogeneous multi-site environment. In: The Proc. of the 9th International Workshop on Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science, pp. 87–104. Springer, Berlin (2003)

    Chapter  Google Scholar 

  27. Sabin, G., Lang, M., Sadayappan, P.: Moldable parallel job scheduling using job efficiency: An iterative approach. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP. Lecture Notes in Computer Science, vol. 4376, pp. 94–114. Springer, Berlin (2006)

    Google Scholar 

  28. Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IPDPS, pp. 1–10 (2008)

  29. Siddiqui, M., Villazón, A., Fahringer, T.: Grid capacity planning with negotiation-based advance reservation for optimized qos. In: SC’06: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, New York, NY, USA, 2006, p. 103. ACM, New York (2006)

    Chapter  Google Scholar 

  30. Song, S., Kwong, Y., Hwang, K.: Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling. In: Proc. of 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05), pp. 65–74 (2005)

  31. Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A robust scheduling strategy for moldable scheduling of parallel jobs. In: CLUSTER, pp. 92–99 (2003)

  32. Sulistio, A., Kim, K.H., Buyya, R.: On incorporating an on-line strip packing algorithm into elastic grid reservation-based systems. Int. Conf. Parallel Distrib. Syst. 2, 1–8 (2007)

    Article  Google Scholar 

  33. Tchernykh, A., Ramírez, J.M., Avetisyan, A., Kuzjurin, N., Grushin, D., Zhuk, S.: Two level job-scheduling strategies for a computational grid. In: PPAM, pp. 774–781 (2005)

  34. 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 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Southeast University, Nanjing, 210096, China

    Jinghui Zhang & Junzhou Luo

Authors
  1. Jinghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junzhou Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinghui Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, J., Luo, J. A comparison of utility-oriented algorithms for scheduling parallel tasks in multi-cluster grid. Cluster Comput 12, 421–438 (2009). https://doi.org/10.1007/s10586-009-0100-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-009-0100-4

Keywords

Search

Navigation