The Community for Technology Leaders
Green Image
Issue No. 03 - March (1986 vol. 35)
ISSN: 0018-9340
pp: 278-280
C.V. Ramamoorthy , Department of Electrical Engineering and Computer Science, University of California
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.
systems with postponed maintenance, Fault-tolerance, long-life systems, optimization, polynomial-time algorithm, reconfiguration, stochastic dynamic programming

C. Ramamoorthy and Y. Ma, "Optimal Reconfiguration Strategies for Reconfigurable Computer Systems with no Repair," in IEEE Transactions on Computers, vol. 35, no. , pp. 278-280, 1986.
89 ms
(Ver 3.3 (11022016))