Wafer-Scale Integration of Systolic Arrays
- 1 May 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-34 (5) , 448-461
- https://doi.org/10.1109/tc.1985.1676584
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- New lower bound techniques for VLSITheory of Computing Systems, 1984
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- Fault-tolerant wafer-scale architectures for VLSIACM SIGARCH Computer Architecture News, 1982
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability OneSIAM Journal on Computing, 1982
- Three-Dimensional Integrated CircuitryPublished by Springer Nature ,1981
- A Critique and an Appraisal of VLSI Models of ComputationPublished by Springer Nature ,1981
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Encoding Data Structures in TreesJournal of the ACM, 1979
- On the Cube of a GraphCanadian Mathematical Bulletin, 1968