This paper concerns the problem of finding efficient task allocation algorithms in mesh structures. An allocation algorithm, called Window-Based-Best-Fit with Validated-Submeshes WBBFVS, has been created. The core of this algorithm lays in the way of finding maximal submeshes what is an important part of the task allocation algorithms based on the stack approach. The new way of finding maximal submeshes avoids post-checking submeshes' redundancy thanks to the proposed initial validation. The elimination of redundancy may increase the speed of the algorithms' performance. The three considered algorithms have been evaluated on the basis of the results of simulation experiments made using the designed and implemented experimentation system. The obtained results of investigation show that the WBBFVS algorithm seems to be very promising.
['Radosław J. Jarecki', 'Iwona. Poźniak-Koszałka', 'Leszek Koszalka', 'Andrzej Kasprzak']
An Approach of Finding Maximal Submeshes for Task Allocation Algorithms in Mesh Structures