.png){kind=icon}
返回
Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2010.06.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the problem of task allocation (i.e., to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation is known to be NP-hard in the strong sense. We propose a new swarm intelligence technique based on the honeybee mating optimization (HBMO) algorithm for this problem. The HBMO based approach combines the power of simulated annealing, genetic algorithms with a fast problem specific local search heuristic to find the best possible solution within a reasonable computation time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Task assignment
Distributed computing
Reliability
Honeybee mating optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.5K
被引数:
8.4K
机构
引用论文
.png){kind=icon}
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 systems: A simulated annealing approach
PREAI
分享收藏
A hybrid particle Swann optimization algorithm for optimal task assignment in distributed systems
PREAI
分享收藏
查看更多内容