Show simple item record

dc.contributor.authorLeighton, Frank Thomsonen_US
dc.contributor.authorLeiserson, Charles E.en_US
dc.date.accessioned2023-03-29T14:22:32Z
dc.date.available2023-03-29T14:22:32Z
dc.date.issued1983-02
dc.identifier.urihttps://hdl.handle.net/1721.1/149046
dc.description.abstractVLSI 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 processor, or cells, on the wafer are likely to be defective. In the paper, we describe practical procedures for integrating wafer-scale systems "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 this work to problems in VLSI layout theory, graphy theory, fault-tolerant systems and planar geometry.en_US
dc.relation.ispartofseriesMIT-LCS-TM-236
dc.titleWafer-scale Integration of Systolic Arraysen_US
dc.identifier.oclc10175085


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record