• Publication
  • 1993
  • Issue No. 6 - June
  • Abstract - Reliability, Reconfiguration, and Spare Allocation Issues in Binary-Tree Architectures Based on Multiple-Level Redundancy
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reliability, Reconfiguration, and Spare Allocation Issues in Binary-Tree Architectures Based on Multiple-Level Redundancy
June 1993 (vol. 42 no. 6)
pp. 713-723

The locally redundant modular tree (LRMT) schemes offer high yield and reliability for trees of relatively few levels but are less effective for large binary trees due to the imbalance of reliability of different levels. A new multiple-level redundancy tree (MLRT) architecture that combines modular schemes with level-oriented schemes which lead to better yield and reliability is presented. The MLRT structure enhances the wafer yield to significant levels by offering separate layers of protection for random and clustered defects. Unlike most existing techniques, this technique performs a more accurate reliability analysis by taking into account both switch and link failures. A measure called the marginal switch to processing element area ratio (MSR) is introduced to precisely characterize the effect of switch complexity on the reliability of the redundant system. A systematic method for the optimal distribution of spare modules of the MLRT structure is also presented. The analyses show that the MLRT structure offers higher yield and system reliability than LRMT and subtree-oriented fault-tolerance (SOFT) structures do.

[1] A. Singh, "Interstitial redundancy: An area efficient fault tolerance scheme for large area VLSI processor arrays,"IEEE Trans. Comput., vol. C-37, pp. 1398-1410, Nov. 1988.
[2] K. Yamashita, S. Hijiya, G. Goto, and N. Matsumura, "Test methods for wafer-scale integration,"Proc. Int. Workshop Defect, Fault Tolerance VLSI Syst., Oct. 1988.
[3] S. Kung, S. Jean, and C. Chang, "Fault-tolerant array processors using single-track switches,"IEEE Trans. Comput., vol. C-38, pp. 501-514, Apr. 1989.
[4] M. Wang, M. Cutler, and S. Su, "Reconfiguration of VLSI/WSI mesh array processors with two-level redundancy,"IEEE Trans. Comput., vol. C-38, pp. 547-554, Apr. 1989.
[5] M. Attallah and S. Kosaraju, "A generalized dictionary machine for VLSI,"IEEE Trans. Comput., vol. C-34, pp. 151-155, Feb. 1985.
[6] J. Bentley and H. Kung, "A tree machine for searching problems,"Proc. Int. Conf. Parallel Processing, pp. 257-266, 1979.
[7] A. Rosenberg, "The Diogenes approach to testable fault-tolerant arrays of processors,"IEEE Trans. Comput., vol. C-32, pp. 902-910, Oct. 1983.
[8] S. Dutt and J. Hayes, "On designing and reconfiguring K-fault-tolerant tree architectures,"IEEE Trans. Comput., vol. C-39, pp. 490-503, Apr. 1990.
[9] A. S. M. Hassan and V. K. Agarwal, "A fault tolerant modular architecture for binary trees,"IEEE Trans. Comput., vol. C-35, no. 4, pp. 356-361, Apr. 1986.
[10] A. Singh, "A reconfigurable modular fault-tolerant binary tree architecture,"17th Int. Symp. Fault-Tolerant Computing, pp. 298-304, July 1987.
[11] C. Raghavendra, A. Avizienis, and M. Ercegovac, "Fault tolerance in binary tree architectures,"IEEE Trans. Comput., vol. C-33, pp. 568-572, June 1984.
[12] M. B. Lowrie and W. K. Fuchs, "Reconfigurable tree architectures using subtree oriented fault tolerance,"IEEE Trans. Comput., vol. C-36, pp. 1172-1182, Oct. 1987.
[13] S. Upadhyaya and S. Chakravarty, "Analysis of a fault-tolerance scheme for processor ensembles,"IEEE Trans. Reliability, vol. 41, pp. 294-302, June 1992.
[14] S. Chakravarty and S. Upadhyaya, "A unified approach to designing fault-tolerant processor ensembles,"Proc. Int. Conf. Parallel. Processing, pp. 339-342, 1988.
[15] P. Lala,Fault-tolerant and fault testable hardware design. Englewood Cliffs, NJ, Prentice-Hall, 1985.
[16] M. Lowrie, "Reconfigurable tree architectures using subtree oriented fault tolerance,"Tech. Rep., Mar. 1987.
[17] M. Howells and V. Agarwal, "A reconfiguration scheme for yield enhancement of large area binary tree architectures,"IEEE Trans. Comput., vol. C-37, pp. 463-468, Apr. 1988.
[18] Y. Chen, "Fault-tolerant design of large area array processors by multiple-level redundancy", Ph.D. dissertation, Elec. Comput. Eng. Dept., State Univ. of New York at Buffalo, July 1991.
[19] C. H. Stapper, "On yield, fault distributions and clustering of particles,"IBM J. Res. Develop., vol. 30, no. 3, pp. 326-338, May 1986.
[20] I. Koren and C. Stapper, "Yield models for defect-tolerant VLSI circuits: A review," inProc. Int. Workshop Defect Fault Tolerance VLSI Syst., Oct. 1988.
[21] C. H. Stapper, "Large-area fault clusters and fault tolerance in VLSI circuits, A review,"IBM J. Res. Develop., vol. 33, pp. 162-173, Mar. 1989.
[22] J. Harden and N. Strader, "Architectural yield optimization for WSI,"IEEE Trans. Comput., vol. C-37, pp. 88-110, Jan. 1988.
[23] I. Koren and D. J. Pradhan, "Modeling the effect of redundancy on yield and performance of VLSI systems,"IEEE Trans. Comput., vol. C-36, pp. 344-355, 1987.
[24] M. Howells, R. Aitken, and V. Agarwal, "Defect tolerant interconnects for VLSI,"Proc. Int. Workshop Defect Fault Tolerance VLSI Syst., Oct. 1988.

Index Terms:
binary-tree architectures; multiple-level redundancy; locally redundant modular tree; multiple-level redundancy tree; MLRT; wafer yield; marginal switch to processing element area ratio; MSR; switch complexity; reliability; system reliability; subtree-oriented fault-tolerance; SOFT; fault tolerant computing; parallel architectures; redundancy.
Citation:
Y.-Y. Chen, S.J. Upadhyaya, "Reliability, Reconfiguration, and Spare Allocation Issues in Binary-Tree Architectures Based on Multiple-Level Redundancy," IEEE Transactions on Computers, vol. 42, no. 6, pp. 713-723, June 1993, doi:10.1109/12.277283
Usage of this product signifies your acceptance of the Terms of Use.