"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.
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.
McMillin, Bruce M.
Dekock, Arlan R.
Ho, C. Y. (Chung You), 1933-1988
Sager, Thomas J.
Randolph, Timothy W.
Ph. D. in Computer Science
University of Missouri--Rolla
xii, 117 pages
© 1993 Jun-Lin Liu, All rights reserved.
Dissertation - Restricted Access
Print OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b2549814~S5
Liu, Jun-Lin, "Fault-tolerant ring embeddings in hypercubes -- A reconfigurable approach" (1993). Doctoral Dissertations. 914.
Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.