Genetic Algorithm for Independent Job Scheduling in Grid Computing
Loading...
Date
2017-06-01
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
Altmetrics
Abstract
Grid computing refers to the infrastructure which connects geographically distributed computers ownedby various organizations allowing their resources, such as computational power and storage capabilities, to beshared, selected, and aggregated. Job scheduling is the problem of mapping a set of jobs to a set of resources.It is considered one of the main steps to e ciently utilise the maximum capabilities of grid computing systems.The problem under question has been highlighted as an NP-complete problem and hence meta-heuristic methodsrepresent good candidates to address it. In this paper, a genetic algorithm with a new mutation procedure tosolve the problem of independent job scheduling in grid computing is presented. A known static benchmark forthe problem is used to evaluate the proposed method in terms of minimizing the makespan by carrying out anumber of experiments. The obtained results show that the proposed algorithm performs better than some knownalgorithms taken from the literature.
Description
Citation
Mendel. 2017 vol. 23, č. 1, s. 65-72. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/54
https://mendel-journal.org/index.php/mendel/article/view/54
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en