Load Balancing and Embedding Rings in Faulty Incrementally Extensible Hypercubes

摘要

This paper proposes a novel algorithm for embedding linear arrays and rings in a faulty Incrementally Extensible Hypercube (IEH). Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n+1) faults can be tolerated with dilation 3, congestion 1 and load 1. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible.