Institutional Repository
| An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems | |
| Kang, Qinma; He, Hong; Wei, Jun | |
| 2013 | |
| Source | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
 |
| ISSN | 0743-7315 |
| Volume | 73Issue:8Pages:1106-1115 |
| English Abstract | 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. |
| Indexed Type | SCI |
| Keyword | Distributed Computing Task Allocation System Reliability Iterated Greedy Algorithm Meta-heuristics |
| Department | [Kang, Qinma; He, Hong] Shandong Univ, Sch Informat Engn, Weihai 264209, Peoples R China. [Kang, Qinma; Wei, Jun] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000325308600008 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16919 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment