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

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).