DocumentCode
305556
Title
A general reconfiguration technique for fault tolerant processor architectures
Author
Belani, Eshwar ; Arsham, A.M. ; Mittal, Ravi
Author_Institution
Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1997
fDate
4-7 Jan 1997
Firstpage
360
Lastpage
363
Abstract
In this paper we present a new approach for fault tolerance in VLSI processor architectures. The reconfiguration technique is a general one in the sense that it can be applied to any arbitrary architecture with any number of spares each of which may be connected to an arbitrary number of processing elements. The technique is composed of two stages, local and global reconfiguration. In the local reconfiguration stage, faulty cells are maximally mapped onto adjacent spares. In the global stage, the shortest path from a faulty cell to a spare is found and the spare is “propagated” to the faulty site by the logical displacement of processing elements along that path
Keywords
VLSI; fault tolerant computing; microprocessor chips; parallel architectures; reconfigurable architectures; SPEAR algorithm; VLSI processor architectures; adjacent spare cells; fault tolerant processor architectures; global reconfiguration; local reconfiguration; reconfiguration technique; Circuit faults; Computer architecture; Computer science; Fault tolerance; Integrated circuit interconnections; Logic arrays; Manufacturing processes; Production; Switches; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design, 1997. Proceedings., Tenth International Conference on
Conference_Location
Hyderabad
ISSN
1063-9667
Print_ISBN
0-8186-7755-4
Type
conf
DOI
10.1109/ICVD.1997.568153
Filename
568153
Link To Document