All shapes contiguous submesh allocation for 2D mesh multicomputers

Ismail Ababneh, Saad Bani-Mohammad, Mohamed Ould-Khaoua

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Although contiguous allocation is known to suffer from high processor fragmentation, it is a viable allocation approach as it isolates jobs from one another, which can improve system security. Most recent contiguous allocation schemes proposed for two-dimensional meshes switch the orientation of allocation requests when allocation fails for the initial request orientation. This transformation was found to reduce processor fragmentation and improve system performance. In this paper, we propose to generalise this restricted transformation by permitting all request shapes. Using simulations, we show that this generalisation when combined with giving priority to allocating peripheral submeshes can result in significant system performance gains.

Original languageEnglish
Pages (from-to)411-421
Number of pages11
JournalInternational Journal of Parallel, Emergent and Distributed Systems
Volume25
Issue number5
DOIs
Publication statusPublished - Oct 2010

Fingerprint

Security systems
Switches

Keywords

  • contiguous submesh allocation
  • job scheduling
  • mesh
  • multicomputer

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

All shapes contiguous submesh allocation for 2D mesh multicomputers. / Ababneh, Ismail; Bani-Mohammad, Saad; Ould-Khaoua, Mohamed.

In: International Journal of Parallel, Emergent and Distributed Systems, Vol. 25, No. 5, 10.2010, p. 411-421.

Research output: Contribution to journalArticle

@article{1aae6458caf94224849ecb9cffba7c43,
title = "All shapes contiguous submesh allocation for 2D mesh multicomputers",
abstract = "Although contiguous allocation is known to suffer from high processor fragmentation, it is a viable allocation approach as it isolates jobs from one another, which can improve system security. Most recent contiguous allocation schemes proposed for two-dimensional meshes switch the orientation of allocation requests when allocation fails for the initial request orientation. This transformation was found to reduce processor fragmentation and improve system performance. In this paper, we propose to generalise this restricted transformation by permitting all request shapes. Using simulations, we show that this generalisation when combined with giving priority to allocating peripheral submeshes can result in significant system performance gains.",
keywords = "contiguous submesh allocation, job scheduling, mesh, multicomputer",
author = "Ismail Ababneh and Saad Bani-Mohammad and Mohamed Ould-Khaoua",
year = "2010",
month = "10",
doi = "10.1080/17445760903546188",
language = "English",
volume = "25",
pages = "411--421",
journal = "International Journal of Parallel, Emergent and Distributed Systems",
issn = "1744-5760",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - All shapes contiguous submesh allocation for 2D mesh multicomputers

AU - Ababneh, Ismail

AU - Bani-Mohammad, Saad

AU - Ould-Khaoua, Mohamed

PY - 2010/10

Y1 - 2010/10

N2 - Although contiguous allocation is known to suffer from high processor fragmentation, it is a viable allocation approach as it isolates jobs from one another, which can improve system security. Most recent contiguous allocation schemes proposed for two-dimensional meshes switch the orientation of allocation requests when allocation fails for the initial request orientation. This transformation was found to reduce processor fragmentation and improve system performance. In this paper, we propose to generalise this restricted transformation by permitting all request shapes. Using simulations, we show that this generalisation when combined with giving priority to allocating peripheral submeshes can result in significant system performance gains.

AB - Although contiguous allocation is known to suffer from high processor fragmentation, it is a viable allocation approach as it isolates jobs from one another, which can improve system security. Most recent contiguous allocation schemes proposed for two-dimensional meshes switch the orientation of allocation requests when allocation fails for the initial request orientation. This transformation was found to reduce processor fragmentation and improve system performance. In this paper, we propose to generalise this restricted transformation by permitting all request shapes. Using simulations, we show that this generalisation when combined with giving priority to allocating peripheral submeshes can result in significant system performance gains.

KW - contiguous submesh allocation

KW - job scheduling

KW - mesh

KW - multicomputer

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

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

U2 - 10.1080/17445760903546188

DO - 10.1080/17445760903546188

M3 - Article

VL - 25

SP - 411

EP - 421

JO - International Journal of Parallel, Emergent and Distributed Systems

JF - International Journal of Parallel, Emergent and Distributed Systems

SN - 1744-5760

IS - 5

ER -