Abstract
In this paper we present an enhanced version of a reported reconfigurable embedding scheme (i.e., DC scheme) that based on the idea of divide and conquer to efficiently embed even length rings in hypercubes. It was shown that the system with the DC scheme is 3-step recoverable and needs an average of 1.3 steps to recover one single fault. Here, we show that the system with the enhanced embedding scheme will be 2-step recoverable when the dimensions of hypercubes are ~ 5, and the system is able to recover any single fault in an average of 1.1 steps.
Recommended Citation
Liu, Junlin and McMillin, Bruce M., "An Enhanced Reconfigurable Embedding Scheme for Rings in Hypercubes" (1992). Computer Science Technical Reports. 137.
https://scholarsmine.mst.edu/comsci_techreports/137
Department(s)
Computer Science
Keywords and Phrases
Embedding, Fault Tolerance, Reconfiguration, Ring, Hypercube.
Report Number
CSc-92-08
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1992 University of Missouri - Rolla, All rights reserved
Publication Date
30 April, 1992
Comments
The first Author is a Graduate Student
This work was supported in part by the National Science Foundation under Grant Nwnbers MIP-8909749 and CDA-8820714, and In part by the AMOCO Faculty Development Program.