Issue No.02 - February (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123400
<p>Two types of algorithms are considered, namely, local algorithms and global algorithms. In a local algorithm, no processors need to know the status of all other processors in the system. The recovery process is distributed among the processors with each processor using extremely local knowledge. With these properties, the reconfiguration algorithm may achieve fast recovery and real time response but many sacrifice the optimal use of redundancy. In contrast, the goal of a global algorithm is to optimize the use of redundancy with respect to some fault tolerance criteria. This, however, requires global knowledge about other processors in the system and often necessitates extensive changes in the configuration of the system. For unmaintained, long-life systems, local fault tolerance algorithms have the advantages of fast recovery, while global fault tolerance algorithms provide better reliability and longer life expectancy. Fortunately, under certain conditions, it is possible to combine the advantages of the two types of algorithms. These conditions are described.</p>
bi-level configurations; fault tolerant arrays; local algorithms; global algorithms; local knowledge; reconfiguration algorithm; fast recovery; real time response; redundancy; global knowledge; long-life systems; fault tolerance algorithms; reliability; life expectancy; fault tolerant computing; multiprocessor interconnection networks; parallel algorithms.
R.G. Melhem, "Bi-Level Reconfigurations of Fault Tolerant Arrays", IEEE Transactions on Computers, vol.41, no. 2, pp. 231-239, February 1992, doi:10.1109/12.123400