File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Chemical reaction optimization for task scheduling in grid computing

TitleChemical reaction optimization for task scheduling in grid computing
Authors
KeywordsChemical Reaction Optimization
Grid Computing
Multicriteria Scheduling
Task Scheduling
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://www.computer.org/tpds
Citation
IEEE Transactions On Parallel And Distributed Systems, 2011, v. 22 n. 10, p. 1624-1631 How to Cite?
AbstractGrid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to supercomputers distributed around the world. One of the major problems is task scheduling, i.e., allocating tasks to resources. In addition to Makespan and Flowtime, we also take reliability of resources into account, and task scheduling is formulated as an optimization problem with three objectives. This is an NP-hard problem, and thus, metaheuristic approaches are employed to find the optimal solutions. In this paper, several versions of the Chemical Reaction Optimization (CRO) algorithm are proposed for the grid scheduling problem. CRO is a population-based metaheuristic inspired by the interactions between molecules in a chemical reaction. We compare these CRO methods with four other acknowledged metaheuristics on a wide range of instances. Simulation results show that the CRO methods generally perform better than existing methods and performance improvement is especially significant in large-scale applications. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155651
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorXu, Jen_US
dc.contributor.authorLam, AYSen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:34:40Z-
dc.date.available2012-08-08T08:34:40Z-
dc.date.issued2011en_US
dc.identifier.citationIEEE Transactions On Parallel And Distributed Systems, 2011, v. 22 n. 10, p. 1624-1631en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://hdl.handle.net/10722/155651-
dc.description.abstractGrid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to supercomputers distributed around the world. One of the major problems is task scheduling, i.e., allocating tasks to resources. In addition to Makespan and Flowtime, we also take reliability of resources into account, and task scheduling is formulated as an optimization problem with three objectives. This is an NP-hard problem, and thus, metaheuristic approaches are employed to find the optimal solutions. In this paper, several versions of the Chemical Reaction Optimization (CRO) algorithm are proposed for the grid scheduling problem. CRO is a population-based metaheuristic inspired by the interactions between molecules in a chemical reaction. We compare these CRO methods with four other acknowledged metaheuristics on a wide range of instances. Simulation results show that the CRO methods generally perform better than existing methods and performance improvement is especially significant in large-scale applications. © 2011 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://www.computer.org/tpdsen_US
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_US
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectChemical Reaction Optimizationen_US
dc.subjectGrid Computingen_US
dc.subjectMulticriteria Schedulingen_US
dc.subjectTask Schedulingen_US
dc.titleChemical reaction optimization for task scheduling in grid computingen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TPDS.2011.35en_US
dc.identifier.scopuseid_2-s2.0-80052319595en_US
dc.identifier.hkuros210455-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052319595&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume22en_US
dc.identifier.issue10en_US
dc.identifier.spage1624en_US
dc.identifier.epage1631en_US
dc.identifier.isiWOS:000294162500003-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridXu, J=36242579700en_US
dc.identifier.scopusauthoridLam, AYS=35322184700en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats