AN EFFICIENT TASK ALLOCATION SCHEME FOR 2D MESH ARCHITECTURES

Efficient allocation of processors to incoming tasks in parallel compu ter systems is very important for achieving the desired high performan ce. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation sche me for 2D mesh architectures. By employing a new approach for searchin g the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simul ation reveals that the average allocation time and waiting delay are m uch smaller than earlier schemes of comparable performances, irrespect ive of the size of meshes and distribution of the shape of the incomin g tasks.