Skip to main content

A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids

  • Conference paper
Hybrid Artificial Intelligence Systems (HAIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5572))

Included in the following conference series:

Abstract

The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybridization of Genetic Algorithms (GAs) and Tabu Search (TS) for scheduling in computational grids. The purpose in this hybridization is to benefit the exploration of the solution space by a population of individuals with the exploitation of solutions through a smart search of the TS. Our GA(TS) hybrid algorithm runs the GA as the main algorithm and calls TS procedure to improve individuals of the population. We evaluated the proposed hybrid algorithm using different Grid scenarios generated by a Grid simulator. The computational results showed that the hybrid algorithm outperforms both the GA and TS for the makespan value but cannot outperform them for the flowtime of the scheduling.

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. Abraham, A., Buyya, R., Nath, B.: Nature’s heuristics for scheduling jobs on computational grids. In: The 8th IEEE International Conference on Advanced Computing and Communications, India (2000)

    Google Scholar 

  2. Alba, E., Almeida, F., Blesa, M., Cotta, C., Díaz, M., Dorta, I., Gabarró, J., León, C., Luque, G., Petit, J., Rodríguez, C., Rojas, A., Xhafa, F.: Efficient parallel LAN/WAN algorithms for optimization. The Mallba project. Parallel Computing 32(5-6), 415–440 (2006)

    Article  Google Scholar 

  3. Braun, T., Siegel, H., Beck, N., Boloni, L., Maheswaran, M., Reuther, A., Robertson, J., Theys, M., Yao, B.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61(6), 810–837 (2001)

    Article  MATH  Google Scholar 

  4. Cahon, S., Melab, N., Talbi, E.: Building with paradisEO reusable parallel and distributed evolutionary algorithms. Parallel Computing 30(5-6), 677–697 (2004)

    Article  MATH  Google Scholar 

  5. Jourdan, L., Basseur, M., Talbi, E.: Hybridizing Exact Method and Metaheuristics: A Taxonomy. European Journal of Operational Research (Online, 2008)

    Google Scholar 

  6. Lau, H.C., Wan, W.C., Lim, M.K., Halim, S.: A Development Framework for Rapid Meta-Heuristics Hybridization. In: Proc. of the 28th Annual International Computer Software and Applications Conference, pp. 362–367 (2004)

    Google Scholar 

  7. Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. TechRep, Centre for Intelligent Systems, University of Edinburgh (2003)

    Google Scholar 

  8. Talbi, E.: A Taxonomy of Hybrid Metaheuristics. J. of Heur. 8(5), 541–564 (2002)

    Article  Google Scholar 

  9. Xhafa, F.: A Hybrid Evolutionary Heuristic for Job Scheduling in Computational Grids, ch. 10. Springer Series: Studies in Comp. Intell., vol. 75 (2007)

    Google Scholar 

  10. Xhafa, F., Barolli, L., Durresi, A.: An Experimental Study on Genetic Algorithms for Resource Allocation on Grid Systems. JOIN 8(4), 427–443 (2007)

    Google Scholar 

  11. Xhafa, F., Carretero, J., Abraham, A.: Genetic Algorithm Based Schedulers for Grid Computing Systems. International Journal of Innovative Computing, Information and Control 3(5), 1–19 (2007)

    Google Scholar 

  12. Xhafa, F., Carretero, J., Dorronsoro, B., Alba, E.: Tabu Search Algorithm for Scheduling Independent Jobs in Computational Grids. Computers and Informatics (to appear, 2009)

    Google Scholar 

  13. Xhafa, F., Carretero, J., Barolli, L., Durresi, A.: Requirements for an Event-Based Simulation Package for Grid Systems. JOIN 8(2), 163–178 (2007)

    Google Scholar 

  14. Xhafa, F., Carretero, J., Barolli, L., Durresi, A.: Immediate Mode Scheduling in Grid Systems. Int. J. of Web and Grid Services 3(2), 219–236 (2007)

    Article  Google Scholar 

  15. Xhafa, F., Barolli, L., Durresi, A.: Batch Mode Schedulers for Grid Systems. International Journal of Web and Grid Services 3(1), 19–37 (2007)

    Article  Google Scholar 

  16. Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xhafa, F., Gonzalez, J.A., Dahal, K.P., Abraham, A. (2009). A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds) Hybrid Artificial Intelligence Systems. HAIS 2009. Lecture Notes in Computer Science(), vol 5572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02319-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02319-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02318-7

  • Online ISBN: 978-3-642-02319-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics