On processor allocation in hypercube multiprocessors

Abstract

The processor allocation problem in a hypercube system is to find a free subcube for a given request. The subcube recognition capability of existing allocation strategies, e.g. the buddy strategy and the Gray code strategy, is far below the theoretical upper bound due to their incomplete representation of the hypercube interconnection structure. A complete strategy that outperforms the existing ones in subcube recognition capability and average waiting time but incurs a higher overhead is proposed. Efficient implementation of the complete strategy is also studied.<>