Issue No. 05 - May (1985 vol. 34)
T. Leighton , Department of Mathematics and the Laboratory for Computer Science, Massachusetts Institute of Technology
VLSI technologists are fast developing wafer-scale integration. Rather than partitioning a silicon wafer into chips as is usually done, the idea behind wafer-scale integration is to assemble an entire system (or network of chips) on a single wafer, thus avoiding the costs and performance loss associated with individual packaging of chips. A major problem with assembling a large system of microprocessors on a single wafer, however, is that some of the processors, or cells, on the wafer are likely to be defective. In the paper, we describe practical procedures for integrating "around" such faults. The procedures are designed to minimize the length of the longest wire in the system, thus minimizing the communication time between cells. Although the underlying network problems are NP-complete, we prove that the procedures are reliable by assuming a probabilistic model of cell failure. We also discuss applications of the work to problems in VLSI layout theory, graph theory, fault-tolerant systems, planar geometry, and the probabilistic analysis of algorithms.
wire length, Channel width, fault-tolerant systems, matching, probabilistic analysis, spanning tree, systolic arrays, traveling salesman problem, tree of meshes, VLSI, wafer-scale integration
C.E. Leiserson, T. Leighton, "Wafer-Scale Integration of Systolic Arrays", IEEE Transactions on Computers, vol. 34, no. , pp. 448-461, May 1985, doi:10.1109/TC.1985.1676584