This paper presents an algorithm for embedding a ring of a given size in a damaged n-cube. Existing algorithms all attempt to find a ring which is as large as possible and can only tolerate up to 2n - Θ(√nlogn) faulty nodes. There are two contributions made in this paper. First, we have identified a problem which is closer to a realistic situation in mapping a parallel algorithm to a hypercube machine. Second, the proposed algorithm can tolerate a significantly larger number (Θ(2n/2)) of faulty nodes, and always embeds a ring with congestion 1 and dilation of at most 2. This result compares favorably to existing algorithms in embedding congestion, embedding dilation, or degrees of fault tolerance.
|Number of pages||17|
|Journal||Journal of Information Science and Engineering|
|State||Published - 1 Dec 1996|
- Fault tolerance
- Graph embedding
- Linear path