HONEYBEE MATING OPTIMIZATION ALGORITHM FOR TASK ASSIGNMENT IN HETEROGENEOUS COMPUTING SYSTEMS

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.