Abstract
Grid job scheduling is an NP complete problem, concerning the large-scale resource and job scheduling, and the adoptive and efficient job scheduling algorithm is required. Genetic algorithms show good capability to solve the problem of the small-scale, but with the increase in the number of jobs and resources, genetic algorithm is hard to convergence or slow convergence. This paper proposed a Memetic Algorithm which designed crossover operators and mutation operator with hill-climbing algorithm and Tabu search algorithm for processing grid job scheduling. Hill Climbing scheduling usually can enhance processor utilization, and Tabu search algorithm have shorter completion times for job scheduling in computing grid. And then the algorithms’ search ability and convergence speed were compared. The simulation results shown that the proposed algorithm can effectively solve the grid job scheduling problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Xhafa, F., Alba, E., Dorronsoro, B., Duran, B.: Efficient batch job scheduling in grids using cellular memetic algorithms. Journal of Mathematical Modelling and Algorithms 7(2), 217–236 (2008)
Braun, T.D., Siegelh, H.J., Beck, N.: 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)
Li, W., Yuan, C.: Research on Grid Scheduling based on Modified Genetic Algorithm. In: Pervasive Computing and Applications, ICPCA 2008 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhong, L., Long, Z., Zhang, J., Song, H. (2011). An Efficient Memetic Algorithm for Job Scheduling in Computing Grid. In: Qi, L. (eds) Information and Automation. ISIA 2010. Communications in Computer and Information Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19853-3_96
Download citation
DOI: https://doi.org/10.1007/978-3-642-19853-3_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19852-6
Online ISBN: 978-3-642-19853-3
eBook Packages: Computer ScienceComputer Science (R0)