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

Bani-Mohammad, S., Ould-Khaoua, M., Abaneh, I. and Mackenzie, L.M. (2007) A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers. Lecture Notes in Computer Science, 4742, pp. 645-656. (doi:10.1007/978-3-540-74742-0_58)

[img]
Preview
Text
banimohammad3736.pdf

280kB

Publisher's URL: http://dx.doi.org/10.1007/978-3-540-74742-0_58

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Ould-Khaoua, Dr Mohamed and Mackenzie, Dr Lewis
Authors: Bani-Mohammad, S., Ould-Khaoua, M., Abaneh, I., and Mackenzie, L.M.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:1611-3349
Copyright Holders:Copyright © 2007 Springer
First Published:First published in Lecture Notes in Computer Science 4742:645-656
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record