标题:Task assignment for minimizing application completion time using honeybee mating optimization
作者:Kang, Qinma; He, Hong
作者机构:[Kang Qinma] School of Information Engineering, Shandong University, State Key Laboratory of Computer Science, Weihai, Shandong 264209, China.;[He Hon 更多
通讯作者:Kang, Q.(qmkang@sdu.edu.cn)
通讯作者地址:[Kang, QM]Shandong Univ, Sch Informat Engn, Weihai 264209, Peoples R China.
来源:计算机科学前沿
出版年:2013
卷:7
期:3
页码:404-415
DOI:10.1007/s11704-013-2130-6
关键词:heterogeneous distributed computing; task assignment; task interaction; graph; honeybee mating optimization; meta-heuristics
摘要: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.
收录类别:EI;CSCD;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84879248868&doi=10.1007%2fs11704-013-2130-6&partnerID=40&md5=ddf1d567b6f9d9a4ac0da60c1434ef06
TOP