Issue No.07 - July (1997 vol.8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.598346
<p><b>Abstract</b>—Current processor allocation techniques for highly parallel systems are typically restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. As a result, message-passing systems have yet to achieve the high utilization levels exhibited by traditional vector supercomputers. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation.</p><p>Three noncontiguous processor allocation strategies—Paging allocation, Random allocation, and the Multiple Buddy Strategy (MBS)—are proposed and studied in this paper. Simulations compare the performance of the noncontiguous strategies with that of several well-known contiguous algorithms. We show that noncontiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous allocation is feasible with current technologies.</p>
Resource management, scheduling, processor allocation, noncontiguous, fragmentation, mesh.
Kurt J. Windisch, Virginia Lo, Bill Nitzberg, "Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 7, pp. 712-726, July 1997, doi:10.1109/71.598346