DocumentCode
2555344
Title
An efficient multi-dimensional grids reconfiguration algorithm on hypercube
Author
Chen, S.K. ; Liang, C.T. ; Tsai, W.T.
Author_Institution
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
fYear
1988
fDate
27-30 June 1988
Firstpage
368
Lastpage
373
Abstract
Reconfiguration algorithms are invoked when a fault is detected in the original loop or multidimensional grid. The reconfiguration algorithms are able to reach an equivalent set of topologies within the same architecture in a distributed manner. The authors propose mapping schemes for certain length of loops so that the resulting systems can recover from any fault within one step. With application of one of the schemes, the reconfiguration strategy for a multidimensional grid system can have better performance.<>
Keywords
fault tolerant computing; multiprocessor interconnection networks; hypercube; multi-dimensional grids reconfiguration algorithm; reconfiguration strategy; Algorithm design and analysis; Binary codes; Computer architecture; Computer science; Fault detection; Fault tolerance; Hypercubes; Intelligent networks; Machine intelligence; Network topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1988. FTCS-18, Digest of Papers., Eighteenth International Symposium on
Conference_Location
Tokyo, Japan
Print_ISBN
0-8186-0867-6
Type
conf
DOI
10.1109/FTCS.1988.5345
Filename
5345
Link To Document