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

S. Bani-Mohammad, M. Ould-Khaoua, I. Ababneh

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network. Request partitioning in our suggested strategy is based on the sub-meshes available for allocation. To evaluate the performance improvement achieved by our strategy and compare it against well-known existing non-contiguous and contiguous strategies, we conduct extensive simulation runs under the assumption of wormhole routing and three communication patterns, notably one-to-all, all-to-all and random. The results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of job turnaround time and system utilization.

Original languageEnglish
Pages (from-to)2867-2883
Number of pages17
JournalInformation Sciences
Volume177
Issue number14
DOIs
Publication statusPublished - Jul 15 2007

Fingerprint

Multicomputers
Mesh
Communication
Turnaround time
Wormhole Routing
Contiguity
Mesh Networks
Contention
Fragmentation
Partitioning
Strategy
Evaluate
Simulation

Keywords

  • Contiguous processor allocation
  • Fragmentation
  • Non-contiguous processor allocation
  • Performance evaluation
  • Simulation
  • System utilization
  • Turnaround time

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Cite this

An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers. / Bani-Mohammad, S.; Ould-Khaoua, M.; Ababneh, I.

In: Information Sciences, Vol. 177, No. 14, 15.07.2007, p. 2867-2883.

Research output: Contribution to journalArticle

@article{a093c85abba74395aa9a62ffbfc42892,
title = "An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers",
abstract = "In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network. Request partitioning in our suggested strategy is based on the sub-meshes available for allocation. To evaluate the performance improvement achieved by our strategy and compare it against well-known existing non-contiguous and contiguous strategies, we conduct extensive simulation runs under the assumption of wormhole routing and three communication patterns, notably one-to-all, all-to-all and random. The results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of job turnaround time and system utilization.",
keywords = "Contiguous processor allocation, Fragmentation, Non-contiguous processor allocation, Performance evaluation, Simulation, System utilization, Turnaround time",
author = "S. Bani-Mohammad and M. Ould-Khaoua and I. Ababneh",
year = "2007",
month = "7",
day = "15",
doi = "10.1016/j.ins.2007.02.022",
language = "English",
volume = "177",
pages = "2867--2883",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "14",

}

TY - JOUR

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

AU - Bani-Mohammad, S.

AU - Ould-Khaoua, M.

AU - Ababneh, I.

PY - 2007/7/15

Y1 - 2007/7/15

N2 - In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network. Request partitioning in our suggested strategy is based on the sub-meshes available for allocation. To evaluate the performance improvement achieved by our strategy and compare it against well-known existing non-contiguous and contiguous strategies, we conduct extensive simulation runs under the assumption of wormhole routing and three communication patterns, notably one-to-all, all-to-all and random. The results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of job turnaround time and system utilization.

AB - In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network. Request partitioning in our suggested strategy is based on the sub-meshes available for allocation. To evaluate the performance improvement achieved by our strategy and compare it against well-known existing non-contiguous and contiguous strategies, we conduct extensive simulation runs under the assumption of wormhole routing and three communication patterns, notably one-to-all, all-to-all and random. The results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of job turnaround time and system utilization.

KW - Contiguous processor allocation

KW - Fragmentation

KW - Non-contiguous processor allocation

KW - Performance evaluation

KW - Simulation

KW - System utilization

KW - Turnaround time

UR - http://www.scopus.com/inward/record.url?scp=34247469352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247469352&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2007.02.022

DO - 10.1016/j.ins.2007.02.022

M3 - Article

VL - 177

SP - 2867

EP - 2883

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 14

ER -