File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TPDS.2011.35
- Scopus: eid_2-s2.0-80052319595
- WOS: WOS:000294162500003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Chemical reaction optimization for task scheduling in grid computing
Title | Chemical reaction optimization for task scheduling in grid computing |
---|---|
Authors | |
Keywords | Chemical Reaction Optimization Grid Computing Multicriteria Scheduling Task Scheduling |
Issue Date | 2011 |
Publisher | IEEE. 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? |
Abstract | Grid 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 Identifier | http://hdl.handle.net/10722/155651 |
ISSN | 2023 Impact Factor: 5.6 2023 SCImago Journal Rankings: 2.340 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xu, J | en_US |
dc.contributor.author | Lam, AYS | en_US |
dc.contributor.author | Li, VOK | en_US |
dc.date.accessioned | 2012-08-08T08:34:40Z | - |
dc.date.available | 2012-08-08T08:34:40Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.citation | IEEE Transactions On Parallel And Distributed Systems, 2011, v. 22 n. 10, p. 1624-1631 | en_US |
dc.identifier.issn | 1045-9219 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155651 | - |
dc.description.abstract | Grid 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.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://www.computer.org/tpds | en_US |
dc.relation.ispartof | IEEE Transactions on Parallel and Distributed Systems | en_US |
dc.subject | Chemical Reaction Optimization | en_US |
dc.subject | Grid Computing | en_US |
dc.subject | Multicriteria Scheduling | en_US |
dc.subject | Task Scheduling | en_US |
dc.title | Chemical reaction optimization for task scheduling in grid computing | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, VOK:vli@eee.hku.hk | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/TPDS.2011.35 | en_US |
dc.identifier.scopus | eid_2-s2.0-80052319595 | en_US |
dc.identifier.hkuros | 210455 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-80052319595&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 22 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.spage | 1624 | en_US |
dc.identifier.epage | 1631 | en_US |
dc.identifier.isi | WOS:000294162500003 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Xu, J=36242579700 | en_US |
dc.identifier.scopusauthorid | Lam, AYS=35322184700 | en_US |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_US |
dc.identifier.issnl | 1045-9219 | - |