J Comb OptimDOI 10.1007/s10878-013-9644-6
An efﬁcient meta-heuristic algorithm for gridcomputing
Jemal H. Abawajy
© Springer Science+Business Media New York 2013
Agridcomputingsystemconsistsofagroupofprogramsandresourcesthatare spread across machines in the grid. A grid system has a dynamic environment anddecentralized distributed resources, so it is important to provide efﬁcient schedulingfor applications. Task scheduling is an NP-hard problem and deterministic algorithmsareinadequateandheuristicalgorithmssuchasparticleswarmoptimization(PSO)areneeded to solve the problem. PSO is a simple parallel algorithm that can be appliedin different ways to resolve optimization problems. PSO searches the problem spaceglobally and needs to be combined with other methods to search locally as well. Inthis paper, we propose a hybrid-scheduling algorithm to solve the independent task-scheduling problem in grid computing. We have combined PSO with the gravitationalemulation local search (GELS) algorithm to form a new method, PSO–GELS. Ourexperimental results demonstrate the effectiveness of PSO–GELS compared to otheralgorithms.
Z. PooranianGraduate School, Dezful Islamic Azad University, Dezful, IranM. Shojafar (
)Department of Information Engineering, Electronics and Telecommunications (DIET),Sapienza University of Rome, Via Eudossiana 18, 00184 Rome, Italye-mail: Shojafar@diet.uniroma1.itJ. H. AbawajySchool of Information Technology, Deakin University, Waurn Ponds, VIC, AustraliaA. AbrahamMachine Intelligence Research Labs (MIR Labs), Scientiﬁc Network for Innovationand Research Excellence, P.O. Box 2259, Auburn, WA 98071-2259, USA