Show simple item record

dc.contributor.authorIzakian, Hesam
dc.contributor.authorLadani, Behrouz Tork
dc.contributor.authorAbraham, Ajith
dc.contributor.authorSnášel, Václav
dc.identifier.citationInternational journal of innovative computing, information and control. 2010, vol. 6, no. 9, p. 4219-4233.en
dc.description.abstractScheduling is one of the core steps to efficiently exploit the capabilities of emergent computational systems such as grid. Grid environment is a dynamic, hetero- geneous and unpredictable one sharing different services among many different users. Because of 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) ap- proach for grid 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 prob- lem search space to find optimal or near-optimal solutions. In this paper, the scheduler aims at minimizing makespan and flowtime simultaneously in grid environment. Exper- imental studies illustrate that the proposed method is more efficient and surpasses those of reported meta-heuristic algorithms for this problem.en
dc.publisherICIC Internationalen
dc.relation.ispartofseriesInternational journal of innovative computing, information and controlen
dc.subjectgrid computingen
dc.subjectparticle swarm optimizationen
dc.titleA discrete particle swarm optimization approach for grid job schedulingen
dc.identifier.locationNení ve fondu ÚKen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record