Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Subcube Allocation in Hypercube Computers
IEEE Transactions on Computers
Logic design theory
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
IEEE Transactions on Computers
Advances in Distributed System Reliability
Advances in Distributed System Reliability
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
International Journal of Computer Applications in Technology
Task migration in all-port wormhole-routed 2D mesh multicomputers
Information Sciences: an International Journal
| Hi-index | 0.00 |
The processor allocation problem requires recognizing and locating a free subcube that can accommodate a request for a subcube of a specified size for an incoming task. Methods reported in the literature fall into two strategies: Bottom-up or bit mapped technique (BMT) and top-down or available cube technique (ACT). Our algorithm that solves the allocation problem in faulty hypercubes falls into the category of ACT's which offer the advantage over BMT's of quickly recognizing whether or not a requested subcube is available in the list of fault-free subcubes. We introduce new algebraic functions and the concept of separation factor to select a subcube for allocation. The notion of overlap-syndrome, defined in the text, quantifies the overlap among free subcubes. Our technique has full subcube recognition ability and thus recognizes more subcubes as compared to bit mapped techniques: Buddy, Gray code and its variants. The advantages of our approach over some of the existing ACT's in terms of fragmentation and overall completion time are described in the text and in simulation results.Index Terms驴Hypercube, processor allocation/deallocation, bit-mapped and available cube strategies, subcube recognition, separation factor, overlap syndrome.