<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>8039</REFNUM><AUTHORS><AUTHOR>Bani Mohammad,S.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Ababneh,I.</AUTHOR></AUTHORS><YEAR>2005</YEAR><TITLE>A Simulation Study of Allocation Strategies on the Mesh Interconnection Networks</TITLE><PUBLISHER>N/A</PUBLISHER><ISBN>TR-2005-194</ISBN><LABEL>Bani Mohammad:2005:8039</LABEL><KEYWORDS><KEYWORD>Multicomputers</KEYWORD></KEYWORDS<ABSTRACT>Contiguous allocation of parallel jobs often suffers from severe fragmentation as it requires that the allocated processors be contiguous and have the same topology as the network connecting these processors. Lifting the contiguity condition could reduce fragmentation. However, this often lead to messages from different jobs to interfere with each other and increase contention inside the network, resulting in high communication delays, and thus in a low overall system speed-up. In this paper, two non-contiguous job allocation strategies, referred to as the Paging and Greedy-Available, are proposed for the 3D mesh network and compared using simulation against the well-known contiguous First Fit strategy. The results show that our proposed non-contiguous strategies exhibit superior performance properties despite the added contention that results from non-contiguity.</ABSTRACT></RECORD></RECORDS></XML>