An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems
文献类型：期刊论文
| 作者 | Kang, Qinma ; He, Hong ; Wei, Jun |
| 刊名 | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
 |
| 出版日期 | 2013 |
| 卷号 | 73期号:8页码:1106-1115 |
| 关键词 | Distributed computing Task allocation System reliability Iterated greedy algorithm Meta-heuristics |
| ISSN号 | 0743-7315 |
| 中文摘要 | This paper investigates the problem of allocating parallel application tasks to processors in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation for more than three processors is known to be NP-hard in the strong sense. To deal with this challenging problem, we propose a simple and effective iterative greedy algorithm to find the best possible solution within a reasonable amount of computation time. The algorithm first uses a constructive heuristic to obtain an initial assignment and iteratively improves it in a greedy way. We study the performance of the proposed algorithm over a wide range of parameters including problem size, the ratio of average communication time to average computation time, and task interaction density. The viability and effectiveness of our algorithm is demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. (C) 2013 Elsevier Inc. All rights reserved. |
| 英文摘要 | This paper investigates the problem of allocating parallel application tasks to processors in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation for more than three processors is known to be NP-hard in the strong sense. To deal with this challenging problem, we propose a simple and effective iterative greedy algorithm to find the best possible solution within a reasonable amount of computation time. The algorithm first uses a constructive heuristic to obtain an initial assignment and iteratively improves it in a greedy way. We study the performance of the proposed algorithm over a wide range of parameters including problem size, the ratio of average communication time to average computation time, and task interaction density. The viability and effectiveness of our algorithm is demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. (C) 2013 Elsevier Inc. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000325308600008 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16919]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Kang, Qinma,He, Hong,Wei, Jun. An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING,2013,73(8):1106-1115. |
| APA | Kang, Qinma,He, Hong,&Wei, Jun.(2013).An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems.JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING,73(8),1106-1115. |
| MLA | Kang, Qinma,et al."An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems".JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 73.8(2013):1106-1115. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。