Summary
In this chapter we present parallel implementations of Memetic Algorithms (MAs) for the problem of scheduling independent jobs in computational grids. The problem of scheduling in computational grids is known for its high demanding computational time. In this work we exploit the intrinsic parallel nature of MAs as well as the fact that computational grids offer large amount of resources, a part of which could be used to compute the efficient allocation of jobs to grid resources.
The parallel models exploited in this work for MAs include both fine-grained and coarse-grained parallelization and their hybridization. The resulting schedulers have been tested through different grid scenarios generated by a grid simulator to match different possible configurations of computational grids in terms of size (number of jobs and resources) and computational characteristics of resources. All in all, the result of this work showed that Parallel MAs are very good alternatives in order to match different performance requirement on fast scheduling of jobs to grid resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Xhafa, F., Duran, B. (2008). Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids. In: Cotta, C., van Hemert, J. (eds) Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70807-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-70807-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70806-3
Online ISBN: 978-3-540-70807-0
eBook Packages: EngineeringEngineering (R0)