期刊
JOURNAL OF SYSTEMS AND SOFTWARE
卷 83, 期 11, 页码 2165-2174出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.jss.2010.06.024
关键词
Task assignment; Distributed computing; Reliability; Honeybee mating optimization
资金
- National Natural Science Foundation of China (NSFC) [60803065]
- China Postdoctor Science foundation [200801029]
- National High Technology Research and Development Program of China (863 Program) [2009AA01Z141]
- National Basic Research Program of China (973 Program) [2010CB328100]
- Program for Changjiang Scholars and Innovative Research Team in University
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据