# Area and Delay Penalties in Restructurable Wafer-Scale Arrays

## Abstract

The penalties for restructuring wafer-scale arrays for yield enhancement are assessed. Each element of the fabricated array is assumed to be defective with independent probability *p*. A fixed fraction *R* of the elements are to be connected into a prespecified defect-free configuration by means of switched interconnections. The area penalty is determined by the required number of tracks per wiring channel *t*. Propagation delay is determined by the required maximum connection length *d*. It is shown that: Connection of *RN* fixed I/O ports to distinct nondefective elements from an *N*-element linear array requires *d*, *t* =θ(log*N*); Connection of *RN* pairs of elements from two *N*-element linear arrays requires only constant *d* and *t*; Connection of a chain of *RN* ^{2} elements from an *N*×*N* array also requires only constant *d* and *t*; Connection of a \(\sqrt R N \times \sqrt R N\) lattice from an *N*×*N* array requires \(d = \Omega (\sqrt {\log N} )\). Constant *t* suffices to connect a lattice if *d*=θ(log*N*). Algorithms are presented that connect any fraction *R* < l-*p* of the elements with probability approaching one as *N* increases. It appears that these results hold even under actual defect distributions.

## Keywords

Active Element Linear Array Occupied Site Source Vertex Connection Distance## Preview

Unable to display preview. Download preview PDF.

## References

- [AB]Abbott, R., et. al. Equipping a Line of Memories with Spare Cells. Electronics (July 28, 1981) pp. 127–130.Google Scholar
- [AC]Aubusson, R., and Catt, I. Wafer-Scale Integration—A Fault Tolerant Procedure. IEEE J. Sol. State Circuits SC-13, 3 (June 1978) pp. 339–344.CrossRefGoogle Scholar
- [BH]Broadbent, S., and Hammersley, J. Percolation Processes. I. Proc. Cambridge Phil. Soc. 53 (1957) pp. 629–641.MathSciNetzbMATHCrossRefGoogle Scholar
- [DE]Deo, N. Graph Theory with Applications to Engineering and Computer Science. Prentice Hall, Englewood Cliffs, NJ (1974) pp. 390–391.zbMATHGoogle Scholar
- [FE]Feller, W. An Introduction to Probability Theory and Its Applications. Vol. II 2nded. Wiley, New York (1971) pp. 194–198.zbMATHGoogle Scholar
- [FHW]Frisch, H., Hammersley, J., and Welsh, D. Monte Carlo Estimates of Percolation Probabilities for Various Lattices. Physical Rev. 126, 3 (May 1, 1962) pp. 949–951.CrossRefGoogle Scholar
- [FV]Fussell, D., Varman, P. Fault Tolerant Wafer-Scale Architectures for VLSI. 9th Ann. Symp. on Comput. Arch. (1982) pp. 190–198.Google Scholar
- [OA]Gallager, R. Information Theory and Reliable Communication. Wiley, New York (1968) pp. 126–128.zbMATHGoogle Scholar
- [GE]Greene, J., El Gamal, A. Area and Delay Penalties for Restructurable VLSI Arrays. To appear, J. of ACM.Google Scholar
- Ham, W. Yield-Area Analysis: Part I-A Diagnostic Tool for Fundamental Integrated-Circuit Process Problems. RCA Rev. 39 (June 1978) pp. 231–249.Google Scholar
- [HCE]Hsia, Y., Chang, G., and Erwin, F. Adaptive Wafer Scale Integration. Japanese J. of Appl. Phys., Vol. 19 (1980) Supplement 19–1, pp. 193–202.Google Scholar
- [HF]Hsia, Y., and Fedorak, R. Impact of MNOS/AWSI Technology on Reprogrammable Arrays. Symposium Record, Semi-Custom Integrated Circuit Technology Symposium (May 26–27, 1981) Washington, DC.Google Scholar
- [HS]Hedlund, K., Snyder, L. Wafer Scale Integration of Configurable, Highly Parallel (CHiP) Processors. Extended Abstract. Proceedings of International Conference on Parallel Processing, IEEE (1982) pp. 262–264.Google Scholar
- [KH]Kim, C., Ham, W. Yield-Area Analysis: Part II-EfiFects of Photomask Alignment Errors on Zero Yield Loci. RCA Rev. 39 (Dec. 1978) pp. 565–576.Google Scholar
- [KO]Koren, I. A Reconfigurable and Fault Tolerant VLSI Multiprocessor Array. Proc. 8th Ann. Symp. on Comput. Architecture, Minneapolis, MN (May 12–14, 1981) pp. 425–442Google Scholar
- [LI]Lincoln Laboratories. Semiannual Technical Summary: Restructurable VLSI Program. ESD-TR-81–153 (Oct. 1981).Google Scholar
- [LL]Leighton, F.T., and Leiserson, C. Wafer Scale Integration of Systolic Arrays. (Extended Abstract). 23rd Ann. Symp. on Foundations of Comput. Sci. (Nov. 1982) pp. 297–311.Google Scholar
- [LM]Lowry, M., Miller, A. Analysis of Low-level Computer Vision Algorithms for Implementation on a VLSI Processor Array. Proc. ARPA Image Understanding Workshop, (September 1982).Google Scholar
- [MI]Minato, O. et.al. HI-CMOS II 4K Static RAM. Digest of Technical Papers, IEEE Solid State Circuits Conf. (1981) pp.14–15.Google Scholar
- [MN]Manning, F. An Approach to Highly Integrated Computer-maintained Cellular Arrays. IEEE Trans. Computers C-26, 6 (June 1977) pp. 536–552.CrossRefGoogle Scholar
- [RO]Rosenberg, A. The Diogenes Approach to Testable Fault-Tolerant Networks of Processors. Duke Univ. Comp. Sci. Dept TR CS-1982–6.1 Rev. May 1982.Google Scholar
- [SM]Smith, R., et.al. Laser Programmable Redundancy and Yield Improvement in a 64K DRAM. IEEE J. Solid-State Circuits SC-16, 5 (Oct. 1981), pp. 506–513.CrossRefGoogle Scholar
- [TH]Thompson, C. A Complexity Theory for VLSI. (Dissertation). Carnegie-Mellon University (August 1980) pp.41–44.Google Scholar
- [Wl]Wierman, J. Percolation Theory. Ann. Prob. 10, 3 (1982) pp. 509–524.MathSciNetzbMATHCrossRefGoogle Scholar