<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8168</REFNUM><AUTHORS><AUTHOR>Bani-Mohammad,S.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Ababneh,I.</AUTHOR><AUTHOR>Mackenzie,L.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>Greedy-Available Non-contiguous Processor Allocation Strategy and Job Scheduling for 2D Mesh Connected Multicomputers</TITLE><PLACE_PUBLISHED>Proc. 11th International CSI Computer Conference, CSICC 2006, January 24-26, 2006, School of Computer Science, IPM, Tehran, Iran. This paper has been selected for the special issue in International Journal of Computers and their Applications, ISCA Press.</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><LABEL>Bani-Mohammad:2006:8168</LABEL><KEYWORDS><KEYWORD>Multicomputers</KEYWORD></KEYWORDS<ABSTRACT>Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and have the same topology as the network connecting these processors. In this paper, non-contiguous processor allocation strategy, referred to as Greedy-Available, is suggested for the 2D mesh network, and is compared using simulation against the well-known non-contiguous Paging strategy and well known contiguous First Fit strategy. In addition to allocation strategies, two job scheduling strategies, referred to as first-come-first-served (FCFS) and out-of-order (OO) are studied, and they are used to compare the performance of allocation strategies. The results reveal that the proposed non-contiguous strategy exhibits superior performance properties despite the added contention that results from non-contiguity. The results also reveal that the OO scheduling strategy is much better than the FCFS scheduling strategy, therefore, the scheduling and allocation strategies both have substantial effect on the performance of contiguous and non-contiguous allocation strategies in 2D mesh.</ABSTRACT></RECORD></RECORDS></XML>