<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8586</REFNUM><AUTHORS><AUTHOR>Bani-Mohammad,S.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Ababneh,I.</AUTHOR><AUTHOR>Mackenzie,L.</AUTHOR></AUTHORS><YEAR>2007</YEAR><TITLE>A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers</TITLE><PLACE_PUBLISHED>The Fifth International Symposium on Parallel and Distributed Processing and Applications (ISPA07) Wednesday, August 29 -- Friday, August 31, 2007 Niagara Falls, ON, CANADA,</PLACE_PUBLISHED><PUBLISHER>Springer</PUBLISHER><PAGES>645-656</PAGES><LABEL>Bani-Mohammad:2007:8586</LABEL><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.</ABSTRACT></RECORD></RECORDS></XML>