RELIABILITY, RECONFIGURATION, AND SPARE ALLOCATION ISSUES IN BINARY-TREE ARCHITECTURES BASED ON MULTIPLE-LEVEL REDUNDANCY

Citation
Yy. Chen et Sj. Upadhyaya, RELIABILITY, RECONFIGURATION, AND SPARE ALLOCATION ISSUES IN BINARY-TREE ARCHITECTURES BASED ON MULTIPLE-LEVEL REDUNDANCY, I.E.E.E. transactions on computers, 42(6), 1993, pp. 713-723
Citations number
24
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Applications & Cybernetics
ISSN journal
00189340
Volume
42
Issue
6
Year of publication
1993
Pages
713 - 723
Database
ISI
SICI code
0018-9340(1993)42:6<713:RRASAI>2.0.ZU;2-N
Abstract
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 differe nt levels. We present a new multiple-level redundancy tree (MLRT) arch itecture that combines modular schemes with level-oriented schemes lea ding to better yield and reliability. The MLRT structure enhances the wafer yield to significant levels by offering separate layers of prote ction for random and clustered defects. Unlike most existing technique s, we perform a more accurate reliability analysis by taking into acco unt both switch and link failures. A new measure called the marginal s witch to processing element area ratio (MSR) is introduced to precisel y characterize the effect of switch complexity on the reliability of t he redundant system. A systematic method for the optimal distribution of spare modules of the MLRT structure is also presented. Our analyses show that the MLRT structure offers higher yield and system reliabili ty than LRMT and subtree-oriented fault-tolerance (SOFT) structures.