<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>7871</REFNUM><AUTHORS><AUTHOR>Ababneh,I.</AUTHOR><AUTHOR>Bani Mohammad,S.</AUTHOR></AUTHORS><YEAR>2003</YEAR><TITLE>Noncontiguous Processor Allocation for Three-Dimensional Mesh Multicomputers</TITLE><PLACE_PUBLISHED> </PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>51-63</PAGES><ISBN>Series D Vol 8 No 2</ISBN><LABEL>Ababneh:2003:7871</LABEL><KEYWORDS><KEYWORD>3D Mesh</KEYWORD></KEYWORDS<ABSTRACT>We study noncontiguous processor allocation for three-dimensional mesh multicomputers, and compare it to contiguous allocation. Contiguous allocation suffers from severe processor fragmentation because it requires that the allocated processors have the same topology as the multicomputer, and that they be contiguous. The goal of lifting the contiguity condition is to reduce fragmentation. However, messages from different parallel applications may interfere with each other and increase contention in the interconnection network. Two contiguous allocation policies, the Paging and Greedy Available policies, are proposed and compared, using simulation, to the well-known contiguous First Fit policy. The results show that the noncontiguous policies are superior to First Fit, despite the added contention that results from noncontiguity.</ABSTRACT></RECORD></RECORDS></XML>