Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
An efficient meta-heuristic algorithm for grid computing

An efficient meta-heuristic algorithm for grid computing

Ratings: (0)|Views: 36|Likes:
Published by Mohammad Shojafar
A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling
for applications. Task scheduling is an NP-hard problem and deterministic algorithms
are inadequate and heuristic algorithms such as particle swarm optimization (PSO) are
needed to solve the problem. PSO is a simple parallel algorithm that can be applied
in different ways to resolve optimization problems. PSO searches the problem space
globally and needs to be combined with other methods to search locally as well. In
this paper, we propose a hybrid-scheduling algorithm to solve the independent task-scheduling problem in grid computing. We have combined PSO with the gravitational
emulation local search (GELS) algorithm to form a new method, PSO–GELS. Our experimental results demonstrate the effectiveness of PSO–GELS compared to other algorithms.
A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling
for applications. Task scheduling is an NP-hard problem and deterministic algorithms
are inadequate and heuristic algorithms such as particle swarm optimization (PSO) are
needed to solve the problem. PSO is a simple parallel algorithm that can be applied
in different ways to resolve optimization problems. PSO searches the problem space
globally and needs to be combined with other methods to search locally as well. In
this paper, we propose a hybrid-scheduling algorithm to solve the independent task-scheduling problem in grid computing. We have combined PSO with the gravitational
emulation local search (GELS) algorithm to form a new method, PSO–GELS. Our experimental results demonstrate the effectiveness of PSO–GELS compared to other algorithms.

More info:

Published by: Mohammad Shojafar on Oct 19, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/18/2014

pdf

text

original

 
 1 23
 Journal of CombinatorialOptimization
 ISSN 1382-6905 J Comb OptimDOI 10.1007/s10878-013-9644-6
n efficient meta-heuristic algorithm for rid computing 
Zahra Pooranian, Mohammad Shojafar,Jemal H. Abawajy & Ajith Abraham
 
 1 23
Your article is protected by copyright and allrights are held exclusively by Springer Science+Business Media New York. This e-offprint isfor personal use only and shall not be self-archived in electronic repositories. If you wishto self-archive your article, please use theaccepted manuscript version for posting onyour own website. You may further depositthe accepted manuscript version in anyrepository, provided it is only made publiclyavailable 12 months after official publicationor later and provided acknowledgement isgiven to the original source of publicationand a link is inserted to the published articleon Springer's website. The link must beaccompanied by the following text: "The finalpublication is available at link.springer.com”.
 
J Comb OptimDOI 10.1007/s10878-013-9644-6
An efficient meta-heuristic algorithm for gridcomputing
Zahra Pooranian
·
Mohammad Shojafar
·
Jemal H. Abawajy
·
Ajith Abraham
© Springer Science+Business Media New York 2013
Abstract
Agridcomputingsystemconsistsofagroupofprogramsandresourcesthatare spread across machines in the grid. A grid system has a dynamic environment anddecentralized distributed resources, so it is important to provide efficient 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.
Keywords
Grid computing
·
PSO algorithm
·
GELS
·
Scheduling
·
Independent tasks
Z. PooranianGraduate School, Dezful Islamic Azad University, Dezful, IranM. Shojafar (
B
)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), Scientific Network for Innovationand Research Excellence, P.O. Box 2259, Auburn, WA 98071-2259, USA
 123

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->