Processor allocation in faulty hypercube multiprocessors

The processor allocation problem in hypercubes is to recognize and locate a free subcube that can accommodate a request for a subcube of a specified size for an incoming task. A new approach for this processor allocation problem in faulty hypercubes is presented. A new concept is introduced, i.e., the growth factor, to select a subcube for allocation, which in turn utilizes the notion of overlap-syndrome to quantify the overlap among free subcubes. The authors' technique has full subcube recognition ability and thus recognizes more subcubes as compared to buddy, Gray code and its variants. The advantages of their approach over some existing approaches are described.<>