An algorithm for a reconfiguration problem (called the SPA problem) for n*n ordinary processors using spare processors is presented. The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, dangerous processors are nonfaulty processors for which there remains no spare processor to be assigned if one more fault occurs. An O(n/sup 2/) algorithm is developed for a basic SPA problem where 2n spare processors are provided. An extension of the SPA problem is defined, and several interesting properties are clarified in order to solve it. In the extension, the spare processors ae assumed to become faulty. >
['Chang Chen', 'An Feng', 'Tohru Kikuno', 'Koji Torii']
Reconfiguration algorithm for fault-tolerant arrays with minimum number of dangerous processors