Allocation Algorithm for Mesh Structured Networks

The paper concerns the allocation problem for mesh structured systems. Standard meshes (rectangular) and shaped meshes (with round shape, with X-shape, etc.) are considered. The newly created Window-Stack Based Algorithm (WSBA) is proposed. The experimentation system designed and implemented in the Java environment is presented. On the basis of simulation experiments WSBA-algorithm is compared with wellknown FS-algorithm. In the static allocation case, the final effect of WSBA, evaluated by the total number of allocated tasks and the fragmentation, is the same as for FS. However, this effect is reached by WSBA with simultaneous running time reduction, decrease of complexity and mesh-shape independence.