Title :
An area-efficient reconfigurable binary tree architecture
Author :
Chen, Chung-Han ; Tzeng, Nian-Feng
Author_Institution :
Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
Abstract :
The VLSI layouts of most fault-tolerant binary tree architectures are based on the classical H-tree layout, resulting in low area utilization and an unnecessarily high manufacturing cost due to the waste of a significant portion of silicon area. An area-efficient approach to the reconfigurable binary tree architecture is presented. Area utilization and interconnection complexity of the proposed design compare favorably with other known approaches. The use of the coverage factor makes it possible to analyze the system reliability by means of the Markov model. Unlike previous reliability studies in which chips are assumed to be defect-free, this analysis considers the fact that an accepted chip may have used spares to replace manufacturing defects, and the number of spares available for tolerating operational faults may thus vary from chip to chip. The developed analytical model for reliability is readily extended to other VSLI/WIS-based multiprocessor systems
Keywords :
VLSI; circuit layout CAD; circuit reliability; fault tolerant computing; parallel architectures; Markov model; VLSI layouts; WIS-based multiprocessor systems; area utilization; area-efficient approach; area-efficient reconfigurable binary tree architecture; coverage factor; fault-tolerant binary tree architectures; interconnection complexity; manufacturing defects; operational faults; reliability; Binary trees; Computer aided manufacturing; Computer architecture; Costs; Fabrication; Fault tolerance; Logic arrays; Redundancy; Switches; Very large scale integration;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings, 1990 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-2079-X
DOI :
10.1109/ICCD.1990.130246