In this thesis, a new approach for dynamic processor allocation in meshconnected multicomputer system is proposed. The proposed strategy makes use of the information of free submeshes for effective processor allocation. The proposed strategy reduces the fragmentation effectively by selecting the submesh in position. The submesh is selected when it causes the least potential fragmentation and it is close enough to a corner. The proposed strategy considers linear array allocation and determines the dimention of the submesh which can serve the linear array allocation request. Extensive simulation is carried out to evaluate the performance of the proposed strategy. And the results show that the proposed strategy gives the best performance in terms of average waiting delay in honoring a request.
