Task assignment for minimizing application completion time using honeybee mating optimization
文献类型：期刊论文
| 作者 | Kang, Qinma ; He, Hong |
| 刊名 | FRONTIERS OF COMPUTER SCIENCE
 |
| 出版日期 | 2013 |
| 卷号 | 7期号:3页码:404-415 |
| 关键词 | heterogeneous distributed computing task assignment task interaction graph honeybee mating optimization meta-heuristics |
| ISSN号 | 2095-2228 |
| 中文摘要 | Effective task assignment is essential for achieving high performance in heterogeneous distributed computing systems. This paper proposes a new technique for minimizing the parallel application time cost of task assignment based on the honeybee mating optimization (HBMO) algorithm. The HBMO approach combines the power of simulated annealing, genetic algorithms, and an effective local search heuristic to find the best possible solution to the problem within an acceptable amount of computation time. The performance of the proposed HBMO algorithm is shown by comparing it with three existing task assignment techniques on a large number of randomly generated problem instances. Experimental results indicate that the proposed HBMO algorithm outperforms the competing algorithms. |
| 英文摘要 | Effective task assignment is essential for achieving high performance in heterogeneous distributed computing systems. This paper proposes a new technique for minimizing the parallel application time cost of task assignment based on the honeybee mating optimization (HBMO) algorithm. The HBMO approach combines the power of simulated annealing, genetic algorithms, and an effective local search heuristic to find the best possible solution to the problem within an acceptable amount of computation time. The performance of the proposed HBMO algorithm is shown by comparing it with three existing task assignment techniques on a large number of randomly generated problem instances. Experimental results indicate that the proposed HBMO algorithm outperforms the competing algorithms. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000320775200007 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16928]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Kang, Qinma,He, Hong. Task assignment for minimizing application completion time using honeybee mating optimization[J]. FRONTIERS OF COMPUTER SCIENCE,2013,7(3):404-415. |
| APA | Kang, Qinma,&He, Hong.(2013).Task assignment for minimizing application completion time using honeybee mating optimization.FRONTIERS OF COMPUTER SCIENCE,7(3),404-415. |
| MLA | Kang, Qinma,et al."Task assignment for minimizing application completion time using honeybee mating optimization".FRONTIERS OF COMPUTER SCIENCE 7.3(2013):404-415. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。