Wafer-scale integration of systolic arrays
- 1 November 1982
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 297-311
- https://doi.org/10.1109/sfcs.1982.49
Abstract
This paper describes and analyzes several algorithms for constructing systolic array networks from cells on a silicon wafer. Some of the cells may be defective, and thus the networks must be configured to avoid them. We adopt a probabilistic model of cell failure, and attempt to construct networks whose maximum wire length is minimal Although the algorithms presented are designed principally for application to the wafer-scale integration of one and two-dimensional systolic arrays, they can also be used to construct networks in well studied models of geometric complexity. Some of the algorithms are of considerable practical interest.Keywords
This publication has 16 references indexed in Scilit:
- 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
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- On the Cube of a GraphCanadian Mathematical Bulletin, 1968
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957