An Iterated Local Search Algorithm for Task Assignment in Distributed Computing Systems

Abstract

This paper considers the problem of task assignment in heterogeneous distributed computing systems with the goal of minimizing the total execution and communication costs. An iterated local search algorithm is proposed for finding the suboptimal task assignment in a reasonable amount of computation time. We study the performance of the proposed algorithm over a wide range of parameters such as the problem scales, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness of the algorithm is manifested by comparing it with other competing algorithms in the relevant literature.