Issue No. 09 - September (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.615439
<p><b>Abstract</b>—Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances, irrespective of the size of meshes and distribution of the shape of the incoming tasks.</p>
Complete submesh recognition, coverage submesh, meshes, task allocation, waiting delay.
B. Shirazi, H. Y. Youn and S. Yoo, "An Efficient Task Allocation Scheme for 2D Mesh Architectures," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 934-942, 1997.