Evaluation and Comparison of Task Allocation Algorithms for Mesh Networks

The paper concerns the task allocation problem for dynamic mesh structured systems. Three allocation algorithms have been evaluated, including well-known Full Search (FS), and Window-Stack Based Algorithm (WSBA) as well as Random Node Check (RNC) designed by the authors. The objective of the paper was a comparison of algorithms efficiencies on the basis of the results of simulations made using multi platform experimentation system designed and implemented in Python environment. The reported investigations have shown that the WSBA algorithm seems to be the most promising.

[1]  Andrzej Kasprzak Topological design of the wide area networks with nonsimultaneous single commodity flow , 1995 .

[2]  Leszek Koszalka Simulation-Based Evaluation of Distributed Mesh Allocation Algorithms , 2007, ISPA Workshops.

[3]  Nian-Feng Tzeng,et al.  Allocating Precise Submeshes in Mesh Connected Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  Laxmi N. Bhuyan,et al.  An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[5]  Leszek Koszalka,et al.  Allocation Algorithm for Mesh Structured Networks , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[6]  Bhabani P. Sinha,et al.  A New Network Topology with Multiple Meshes , 1999, IEEE Trans. Computers.