A fast and efficient strategy for submesh allocation in mesh-connected parallel computers

Authors:
Das Sharma; Pradhan
Affiliations:
Dept. of Comput. Sci., Texas A&MUniv., College Station, TX, USA;Dept. of Comput. Sci., Texas A&MUniv., College Station, TX, USA
Venue:
SPDP '93 Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing
Year:
1993

Citing 0
Cited 5

Hardware implementation of processor allocation schemes for mesh-based chip multiprocessors

Microprocessors & Microsystems
3D compaction: a novel blocking-aware algorithm for online hardware task scheduling and placement on 2D partially reconfigurable devices

ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Multi-toroidal interconnects: using additional communication links to improve utilization of parallel computers

JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Task allocation in mesh structure: 2side leapfrog algorithm and q-learning based algorithm

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Using task migration to improve non-contiguous processor allocation in NoC-based CMPs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach for dynamic submesh allocation in mesh-connected multiprocessor system, which supports a multi-user environment, is proposed. The proposed strategy effectively prunes the search space by searching for free submeshes on the corners of allocated submeshes along with the corners of the mesh system. A submesh is selected with the potential of causing the least amount of fragmentation in the system. The proposed strategy possesses complete submesh recognition capability; it is a best-fit strategy, as well. Existing strategies do not provide this combination of capabilities. The deallocation time and memory overhead is shown to be constant in that it does not grow with the size of the mesh.Simulation results indicate that the proposed strategy outperforms the existing ones in terms of parameters such as average delay in honoring a request, standard deviation of the delays, average allocation time, average deallocation time, and the amount of memory required.