Non-contiguous Processor Allocation Strategy for 2D Mesh Connected Multicomputers based on Sub-meshes Available for Allocation

Authors:
S. Bani-Mohammad;M. Ould-Khaoua;I. Ababneh;Lewis M. Mackenzie
Affiliations:
Glasgow University, UK;Glasgow University, UK;Al al-Bayt University, Jordan;Glasgow University, UK
Venue:
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Year:
2006

Citing 9
Cited 5

A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Performance improvement of allocation schemes for mesh-connected computers

Journal of Parallel and Distributed Computing
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers

IEEE Transactions on Computers
Introduction to Parallel Computing

Introduction to Parallel Computing
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers

IEEE Micro
Allocating Precise Submeshes in Mesh Connected Systems

IEEE Transactions on Parallel and Distributed Systems
Multi-tasking Method on Parallel Computers which Combines a Contiguous and Non-contiguous Processor Partitioning Algorithm

PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization

An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers

Information Sciences: an International Journal
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

Journal of Systems and Software
On improved processor allocation in 2D mesh-based multicomputers: controlled splitting of parallel requests

Proceedings of the 2011 International Conference on Communication, Computing & Security
A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
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

Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology connecting these processors. In non-contiguous allocation, a job can execute on multiple disjoint smaller sub-meshes rather than always waiting until a single sub-mesh of the requested size is available. Lifting the contiguity condition in non-contiguous allocation is expected to reduce processor fragmentation and increase processor utilization. However, the communication overhead is increased because the distances traversed by messages can be longer. The extra communication overhead depends on how the allocation request is partitioned and allocated to free sub-meshes. In this paper, a new noncontiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network, and is compared using simulation against the well-known non-contiguous and contiguous allocation strategies. To show the performance improved by proposed strategy, we conducted simulation runs under the assumption of wormhole routing and all-to-all communication pattern. The results show that the proposed strategy can reduce the communication overhead and improve performance substantially in terms of turnaround times of jobs and finish times.