An efficient task allocation scheme for 2D mesh architectures

An efficient task allocation system has been developed for 2D mesh architectures that does not require scanning of the whole mesh to locate the available submesh. Computer simulation shows reduced average waiting delay and allocation time in comparison with other systems, regardless of the shape distribution of incoming tasks and mesh size. The optimum performance of parallel computers can be best achieved by allocating the processors to incoming tasks most efficiently.