Fault-tolerant ring embeddings in hypercubes -- A reconfigurable approach

<p>"We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (without redundant processors and links). The fundamental idea for these schemes is to embed a basic network on the hypercube without fully utilizing the nodes on the hypercube. The remaining nodes can be used as spares to reconfigure the embeddings in case of faults. The result of this research shows that by carefully embedding the application graphs, the topological properties of the embedding can be preserved under fault conditions, and reconfiguration can be carried out efficiently.</p> <p>In this dissertation, we choose the ring as the basic network of interest, and propose several schemes for the design of reconfigurable embeddings with the aim of minimizing reconfiguration cost and performance degradation. The cost is measured by the number of node-state changes or reconfiguration steps needed for processing of the reconfiguration, and the performance degradation is characterized as the dilation of the new embedding after reconfiguration. Compared to the existing schemes, our schemes surpass the existing ones in terms of applicability of schemes and reconfiguration cost needed for the resulting embeddings"--Abstract, page iii.</p>

Name thesis:degree_name

Ph. D. in Computer Science

Grantor

University of Missouri--Rolla

Year dc:date.available

2016

Author dc:creator

• Liu, Jun-Lin

• Computer Sciences

Repository record dc:identifier

https://scholarsmine.mst.edu/doctoral_dissertations/914

OAI identifier oai:identifier

oai:scholarsmine.mst.edu:doctoral_dissertations-1916