An Efficient Tree-Based Processor Allocation Scheme For Mesh Connected Systems

Abstract

Processor allocation is one of the key issues in the management of mesh connected systems. In this paper, we propose an efficient tree-based processor allocation scheme, called Tree-Allocation (TA), and an Earliest-Available-First-Reserved (EAFR) strategy for mesh connected systems. The TA scheme uses a binary tree to keep the processor allocation information, and its time complexity is O(NB) where NB is the number of busy meshes. The EAFR strategy reserves an earliest available submesh for the incoming task which cannot be executed immediately. Our simulation results indicate that the TA scheme outperforms other allocation schemes in the literature in terms of the average allocation time, system utilization and average waiting time.