All shapes contiguous submesh allocation for 2D mesh multicomputers

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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
Issue number5
Publication statusPublished - Oct 2010


  • contiguous submesh allocation
  • job scheduling
  • mesh
  • multicomputer

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications


Dive into the research topics of 'All shapes contiguous submesh allocation for 2D mesh multicomputers'. Together they form a unique fingerprint.

Cite this