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
U2 - 10.1007/978-3-540-74742-0_58
DO - 10.1007/978-3-540-74742-0_58
M3 - Conference contribution
AN - SCOPUS:38149130426
SN - 3540747419
SN - 9783540747413
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 645
EP - 656
BT - Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq
PB - Springer Verlag
T2 - 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
Y2 - 29 August 2007 through 31 August 2007
ER -