An assignment algorithm for reconfiguration of fault tolerant linear array

A new technique for reconfiguration of a fault-tolerant linear array that is constructed by connecting multiple modular redundant processors is proposed. The array has the following characteristics: a fault of any copy of each processor can be masked without the need for reconfiguration, and the array can be efficiently reconfigured for maximizing the capability to detect and correct any future faults when some voters and copies of processors fail. The reconfiguration problem for the array is formalized, and a linear time algorithm for the reconfiguration is proposed. An extension of the reconfiguration problem and its algorithm are discussed.<>