A DISCRETE PARTICLE SWARM OPTIMIZATION APPROACH FOR GRID JOB SCHEDULING

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075395" target="_blank" >RIV/61989100:27240/10:86075395 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A DISCRETE PARTICLE SWARM OPTIMIZATION APPROACH FOR GRID JOB SCHEDULING
Original language description
Scheduling is one of the core steps to efficiently exploit the capabilities of emergent computational systems such as grid. Grid environment is a dynamic, heterogeneous and unpredictable one sharing different services among many different users. Becauseof heterogeneous and dynamic nature of grid, the methods used in traditional systems could not be applied to grid scheduling and therefore new methods should be looked for. This paper represents a discrete Particle Swarm Optimization (DPSO) approach forgrid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper, the scheduler aims at minimizing makespan and flowtime simultaneously in grid environment. Experimental studies illustrate that the proposed method is more efficient and surpasses those of reported meta-heuristic algorithms for this problem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: New methods od data transmition based on turbo code</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)