A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The performance of contiguous allocation strategies can be significantly affected by the distribution of 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 show that the strategies that depend on a list of allocated sub-meshes for both allocation and deallocation have lower allocation overhead and deliver good system performance in terms of average turnaround time and mean system utilization.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages645-656
Number of pages12
Volume4742 LNCS
Publication statusPublished - 2007
Event5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 - Niagara Falls, Canada
Duration: Aug 29 2007Aug 31 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4742 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
CountryCanada
CityNiagara Falls
Period8/29/078/31/07

Fingerprint

Multicomputers
Performance Comparison
Scheduling
Mesh
Turnaround time
Execution Time
Heavy-tailed Distribution
Experiments
Pareto Distribution
Time-average
Strategy
Simulation Experiment
System Performance
System of systems

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., & Mackenzie, L. (2007). A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4742 LNCS, pp. 645-656). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).

A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. / Bani-Mohammad, Saad; Ould-Khaoua, Mohamed; Ababneh, Ismail; Mackenzie, Lewis.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS 2007. p. 645-656 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bani-Mohammad, S, Ould-Khaoua, M, Ababneh, I & Mackenzie, L 2007, A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4742 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4742 LNCS, pp. 645-656, 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, Canada, 8/29/07.
Bani-Mohammad S, Ould-Khaoua M, Ababneh I, Mackenzie L. A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS. 2007. p. 645-656. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bani-Mohammad, Saad ; Ould-Khaoua, Mohamed ; Ababneh, Ismail ; Mackenzie, Lewis. / A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS 2007. pp. 645-656 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d140ba21b8114a909a26fa8ada3ade4e,
title = "A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers",
abstract = "The performance of contiguous allocation strategies can be significantly affected by the distribution of 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 show that the strategies that depend on a list of allocated sub-meshes for both allocation and deallocation have lower allocation overhead and deliver good system performance in terms of average turnaround time and mean system utilization.",
author = "Saad Bani-Mohammad and Mohamed Ould-Khaoua and Ismail Ababneh and Lewis Mackenzie",
year = "2007",
language = "English",
isbn = "3540747419",
volume = "4742 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "645--656",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers

AU - Bani-Mohammad, Saad

AU - Ould-Khaoua, Mohamed

AU - Ababneh, Ismail

AU - Mackenzie, Lewis

PY - 2007

Y1 - 2007

N2 - The performance of contiguous allocation strategies can be significantly affected by the distribution of 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 show that the strategies that depend on a list of allocated sub-meshes for both allocation and deallocation have lower allocation overhead and deliver 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 distribution of 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 show that the strategies that depend on a list of allocated sub-meshes for both allocation and deallocation have lower allocation overhead and deliver good system performance in terms of average turnaround time and mean system utilization.

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

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

M3 - Conference contribution

SN - 3540747419

SN - 9783540747413

VL - 4742 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 645

EP - 656

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -