NDLI: Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation

Content Provider	IEEE Xplore Digital Library
Author	Bani-Mohammad, S. Ould-Khaoua, M. Ababneh, I. Mackenzie, L.M.
Copyright Year	2006
Description	Author affiliation: Comput. Sci., Glasgow Univ. (Bani-Mohammad, S.; Ould-Khaoua, M.)
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
Sponsorship	IEEE Comput. Soc. Tech. Comm. on Parallel Process
File Size	226431
File Format	PDF
ISBN	0769526128
ISSN	15219097
DOI	10.1109/ICPADS.2006.68
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-07-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer networks Concurrent computing Network topology Joining processes Degradation Mesh networks Routing Context Parallel machines
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Multicomputers

An Efficient Turning Busy List Sub-mesh Allocation Strategy for 3D Mesh Connected Multicomputers (2006)

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

Non-contiguous Processor Allocation Algorithms for Mesh-connected Multicomputers (1994)

Processor Allocation with Reduced Internal and External Fragmentation in 2D Mesh-based Multicomputers

The effect of heavy-tailed distribution on the performance of non-contiguous allocation strategies in 2D mesh connected multicomputers

Comparative evaluation of the non-contiguous processor allocation strategies based on a real workload and a stochastic workload on multicomputers

Efficient processor allocation strategies for mesh-connected multicomputers (2008).

PROCESSOR ALLOCATION IN 2D MESH-CONNECTED MULTICOMPUTERS

Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation

Similar Documents

An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Multicomputers

An Efficient Turning Busy List Sub-mesh Allocation Strategy for 3D Mesh Connected Multicomputers (2006)

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

Non-contiguous Processor Allocation Algorithms for Mesh-connected Multicomputers (1994)

Processor Allocation with Reduced Internal and External Fragmentation in 2D Mesh-based Multicomputers

The effect of heavy-tailed distribution on the performance of non-contiguous allocation strategies in 2D mesh connected multicomputers

Comparative evaluation of the non-contiguous processor allocation strategies based on a real workload and a stochastic workload on multicomputers

Efficient processor allocation strategies for mesh-connected multicomputers (2008).

PROCESSOR ALLOCATION IN 2D MESH-CONNECTED MULTICOMPUTERS

Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation