Task allocation in mesh structure: 2Side LeapFrog algorithm and Q-learning based algorithm

Abstract

This paper concerns the problem of task allocation on the mesh structure of processors. Two created algorithms: 2 Side LeapFrog and Q-learning Based Algorithm are presented. These algorithms are evaluated and compared to known task allocation algorithms. To measure the algorithms' efficiency we introduced our own evaluating function - the average network load. Finally, we implemented an experimentation system to test these algorithms on different sets of tasks to allocate. In this paper, there is a short analysis of series of experiments conducted on three different categories of task sets: small tasks, mixed tasks and large tasks. The results of investigations confirm that the created algorithms seem to be very promising. © 2012 Springer-Verlag.