.png){kind=icon}
返回
An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2013.03.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Distributed computing
Task allocation
System reliability
Iterated greedy algorithm
Meta-heuristics
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization.png)
Polym. Chem.
OAAI
Polym. Chem.IF0
OAAI分享收藏分享收藏分享收藏
Thallium alloys of the rare earth: SmTI Phase diagram and molar volumes of the rare earth thallides
PREAI
分享收藏Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization使用蜜蜂交配优化最大化分布式计算系统可靠性的任务分配
PREAI
分享收藏
查看更多内容