Abstract

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. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.