DocumentCode :
1153419
Title :
Optimal Reconfiguration Strategies for Reconfigurable Computer Systems with no Repair
Author :
Ramamoorthy, C.V. ; Ma, Y. W Eva
Author_Institution :
Department of Electrical Engineering and Computer Science, University of California
Issue :
3
fYear :
1986
fDate :
3/1/1986 12:00:00 AM
Firstpage :
278
Lastpage :
280
Abstract :
In this correspondence, we study the problem of finding optimal reconfiguration strategies for a class of reconfigurable fault- tolerant computer systems in which there is no repair in failed components. The problem of finding optimal reconfiguration strategies consists of determining, for each failed state of the system, the operational state into which the system should reconfigure itself. We presented a stochastic model for the above class of reconfigurable computer systems. Based on this model, we construct a polynomial-time algorithm for finding optimal reconfiguration strategies.
Keywords :
Fault-tolerance; long-life systems; optimization; polynomial-time algorithm; reconfiguration; stochastic dynamic programming; systems with postponed maintenance; Degradation; Fault tolerant systems; Information science; Maintenance; Military computing; Multiprocessing systems; Polynomials; Signal processing algorithms; Stochastic systems; Switches; Fault-tolerance; long-life systems; optimization; polynomial-time algorithm; reconfiguration; stochastic dynamic programming; systems with postponed maintenance;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1986.1676751
Filename :
1676751
Link To Document :
بازگشت