Issue No. 05 - May (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.852401
<p><b>Abstract</b>—Composed of various topologies, the <it>k</it>-ary <it>n</it>-cube system is desirable for accepting and executing topologically different tasks. To utilize its large amount of processor resources, several allocation strategies have been reported, each with certain restrictions that affect performance. For improvement, we propose a new allocation strategy for the <it>k</it>-ary <it>n</it>-cubes. The proposed strategy is an extension of the TC strategy for hypercubes and is able to recognize all subcubes with different topologies requested by tasks. Complexity analysis and performance comparison between related strategies are provided to demonstrate their advantages and disadvantages. Simulation results show that with full subcube recognition ability and no internal fragmentation, our strategy always exhibits better performance.</p>
Full subcube recognition, internal and external fragmentation, k-ary n-cube multiprocessors, performance evaluation, processor allocation, time complexity.
Po-Jen Chuang, Chih-Ming Wu, "An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 485-490, May 2000, doi:10.1109/71.852401