Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation
Issue No. 10 - October (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.473519
<p><it>Abstract</it>—A new approach for dynamic processor allocation in hypercube multicomputers which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach, capable of efficiently handling cubic as well as noncubic allocation. Time complexities for both allocation and deallocation are shown to be polynomial, a significant improvement over the existing exponential and even super-exponential algorithms. Unlike existing schemes, the proposed strategies are best-fit strategies within their search space. Simulation results indicate that the proposed strategies outperform the existing ones in terms of parameters such as average delay in honoring a request, average allocation time, average deallocation time, and memory overhead.</p>
Cubic allocation, deallocation, dynamic binary tree, fragmentation, hypercube, noncubic allocation.
D. Das Sharma and D. K. Pradhan, "Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 1108-1122, 1995.