Processor allocation in faulty hypercube multiprocessors

Document Type

Conference Proceeding

Publication Date

1-1-1993

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. This paper presents a new approach for the processor allocation problem in faulty hypercubes. We introduce a new concept, the growth factor, to select a subcube for allocation, which in turn utilizes the notion of overlap-syndrom to quantify the overlap among free subcubes. Our technique has full subcube recognition ability and thus recognizes more subcubes as compared to buddy, Gray code and its variants. The advantages of our approach over some existing approaches are described.

Publication Source (Journal or Book title)

Proceedings - IEEE International Symposium on Circuits and Systems

First Page

1995

Last Page

1998

This document is currently not available here.

Share

COinS