Processor Allocation in Mesh Multiprocessors Using a Hybrid Method
Sanya Attari, Ayaz Isazadeh · 2006
Mesh-connected systems have become popular because of their simple structure. Most of the allocation strategies in mesh systems are contiguous or noncontiguous. We propose a new hybrid processor allocation algorithm for mesh-connected systems. This method starts by processor allocation contiguously; when contiguous allocation is not possible, the request is decomposed into smaller sub-meshes, such that for each sub-mesh a region can be allocated. Regions formed in this method have no regular forms and as a result all the free processors in a mesh are useful in allocating process and number of rejected requests have become minimum. Compared to the other schemes, the proposed algorithm minimizes the communication delay among the selected processors. Our method combines the advantages of both contiguous and non-contiguous allocation schemes. We will show that it achieves minimum job response time and waiting time compared to the other strategies as well as improving the system utilization by using all idle processors in the system