期刊
INTELLIGENT AUTOMATION AND SOFT COMPUTING
卷 19, 期 1, 页码 69-84出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/10798587.2013.771438
关键词
Meta-heuristics; Task assignment; Heterogeneous distributed computing; Task interaction graph; Honeybee mating optimization
Effective task assignment is essential for achieving high performance in heterogeneous distributed computing systems. This paper proposes a new technique based on the honeybee mating optimization (HBMO) algorithm for solving the problem with the objective of minimizing the total execution and communication costs. We discuss the adaptation and implementation of the HBMO search strategy to the task assignment problem. Through simulations over a wide range of parameters, we demonstrate the performance of our method by comparing it with three existing task assignment techniques from the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据