Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

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

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

The performance of contiguous allocation strategies can be significantly affected by the type of the distribution adopted for job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling strategies under a variety of system loads and system sizes. The results show that the performance of the allocation strategies degrades considerably when job execution times follow a heavy-tailed distribution. Moreover, SSD copes much better than FCFS scheduling strategy in the presence of heavy-tailed job execution times. The results also reveal that allocation strategies that employ a list of allocated sub-meshes for both allocation and de-allocation exhibit low allocation overhead, and maintain good system performance in terms of average turnaround time and mean system utilization.

Original languageEnglish
Pages (from-to)307-318
Number of pages12
JournalThe Journal of Systems and Software
Volume82
Issue number2
DOIs
Publication statusPublished - Feb 2009

Fingerprint

Scheduling
Turnaround time
Experiments
System of systems

Keywords

  • Allocation overhead
  • Contiguous processor allocation
  • Heavy-tailed distribution
  • System utilization
  • Turnaround time

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Information Systems

Cite this

Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers. / Bani-Mohammad, S.; Ould-Khaoua, M.; Ababneh, I.; Mackenzie, Lewis M.

In: The Journal of Systems and Software, Vol. 82, No. 2, 02.2009, p. 307-318.

Research output: Contribution to journalArticle

Bani-Mohammad, S. ; Ould-Khaoua, M. ; Ababneh, I. ; Mackenzie, Lewis M. / Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers. In: The Journal of Systems and Software. 2009 ; Vol. 82, No. 2. pp. 307-318.
@article{ccf64893b4144ce4a409ef9340160447,
title = "Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers",
abstract = "The performance of contiguous allocation strategies can be significantly affected by the type of the distribution adopted for job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling strategies under a variety of system loads and system sizes. The results show that the performance of the allocation strategies degrades considerably when job execution times follow a heavy-tailed distribution. Moreover, SSD copes much better than FCFS scheduling strategy in the presence of heavy-tailed job execution times. The results also reveal that allocation strategies that employ a list of allocated sub-meshes for both allocation and de-allocation exhibit low allocation overhead, and maintain good system performance in terms of average turnaround time and mean system utilization.",
keywords = "Allocation overhead, Contiguous processor allocation, Heavy-tailed distribution, System utilization, Turnaround time",
author = "S. Bani-Mohammad and M. Ould-Khaoua and I. Ababneh and Mackenzie, {Lewis M.}",
year = "2009",
month = "2",
doi = "10.1016/j.jss.2008.06.033",
language = "English",
volume = "82",
pages = "307--318",
journal = "Journal of Systems and Software",
issn = "0164-1212",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

AU - Bani-Mohammad, S.

AU - Ould-Khaoua, M.

AU - Ababneh, I.

AU - Mackenzie, Lewis M.

PY - 2009/2

Y1 - 2009/2

N2 - The performance of contiguous allocation strategies can be significantly affected by the type of the distribution adopted for job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling strategies under a variety of system loads and system sizes. The results show that the performance of the allocation strategies degrades considerably when job execution times follow a heavy-tailed distribution. Moreover, SSD copes much better than FCFS scheduling strategy in the presence of heavy-tailed job execution times. The results also reveal that allocation strategies that employ a list of allocated sub-meshes for both allocation and de-allocation exhibit low allocation overhead, and maintain good system performance in terms of average turnaround time and mean system utilization.

AB - The performance of contiguous allocation strategies can be significantly affected by the type of the distribution adopted for job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling strategies under a variety of system loads and system sizes. The results show that the performance of the allocation strategies degrades considerably when job execution times follow a heavy-tailed distribution. Moreover, SSD copes much better than FCFS scheduling strategy in the presence of heavy-tailed job execution times. The results also reveal that allocation strategies that employ a list of allocated sub-meshes for both allocation and de-allocation exhibit low allocation overhead, and maintain good system performance in terms of average turnaround time and mean system utilization.

KW - Allocation overhead

KW - Contiguous processor allocation

KW - Heavy-tailed distribution

KW - System utilization

KW - Turnaround time

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

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

U2 - 10.1016/j.jss.2008.06.033

DO - 10.1016/j.jss.2008.06.033

M3 - Article

VL - 82

SP - 307

EP - 318

JO - Journal of Systems and Software

JF - Journal of Systems and Software

SN - 0164-1212

IS - 2

ER -