Task assignment for minimizing application completion time using honeybee mating optimization

ISCAS OpenIR

	Task assignment for minimizing application completion time using honeybee mating optimization
	Kang, Qinma; He, Hong
	2013
发表期刊	FRONTIERS OF COMPUTER SCIENCE
ISSN	2095-2228
卷号	7 期号:3 页码:404-415
摘要	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
关键词	Heterogeneous Distributed Computing Task Assignment Task Interaction Graph Honeybee Mating Optimization Meta-heuristics
部门归属	[Kang, Qinma; He, Hong] Shandong Univ, Sch Informat Engn, Weihai 264209, Peoples R China. [Kang, Qinma] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China.
语种	英语
WOS记录号	WOS:000320775200007
引用统计
内容类型	期刊论文
URI标识	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.