Allocation time-based processor allocation scheme for 2D mesh architecture

The mesh is a widely used architecture in parallel computing systems. Research on efficient allocation of processors to incoming tasks on a mesh architecture is very important in achieving the desired high performance. The processor allocation strategy proposed in this paper is based on a well-known boundary search approach by considering allocation time similarity as another primary allocation decision-making factor. In this proposed technique, an additional novel heuristic is employed to consider allocating tasks with similar allocation times with submeshes adjacent to each other, whenever feasible. The external fragmentation problem is expected to be alleviated, which leads to improvement in, better utilization and shorter task waiting time. Our simulation results demonstrate a substantial improvement