Abstract
A description is given of two known strategies for static-processor allocation in an n-cube multiprocessor, namely, the buddy-system strategy and the gray-code strategy. A strategy is proposed that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in a cube recognition. The authors' strategy is suitable for static as well as dynamic processor allocation, and it results in less system fragmentation, more subcube recognition, and higher fault tolerance. The authors also introduce an extension to their strategy that will enhance the performance drastically so that their algorithm together with the extension will outperform the buddy system by a factor of (k(n-k)+1) and the gray strategy by (k(n-k)+1)/2 in cube recognition. The implementation details for these algorithms are described.< >