On driving many long wires in a VLSI layout
- 10 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (4) , 687-701
- https://doi.org/10.1145/6490.6784
Abstract
It is assumed that long wires represent large capacitive loads, and the effect on the area of a VLSI layout when drivers are introduced along many long wires in the layout is investigated. A layout is presented for which the introduction of standard drivers along long wires squares the area of the layout; it is shown, however, that the increase in area is never greater than the layout's area squared if the driver can be laid out in a square region. This paper also shows an area-time trade-off for the driver of a single long wire of length / by which the area of the driver from Θ( l ), to Θ( l q ), q < l, can be reduced if a delay of Θ( l l-q ) rather than Θ(log l ) can be tolerated. Tight bounds are also obtained on the worst-case area increase in general layouts having these drivers.Keywords
This publication has 9 references indexed in Scilit:
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- A model of computation for VLSI with related complexity resultsPublished by Association for Computing Machinery (ACM) ,1981
- Bounds on minimax edge length for complete binary treesPublished by Association for Computing Machinery (ACM) ,1981
- The VLSI Complexity of SortingPublished by Springer Nature ,1981
- A Critique and an Appraisal of VLSI Models of ComputationPublished by Springer Nature ,1981
- The chip complexity of binary arithmeticPublished by Association for Computing Machinery (ACM) ,1980
- Cost and performance of VLSI computing structuresIEEE Journal of Solid-State Circuits, 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Comments on "An optimized output stage for MOS integrated circuits" [with reply]IEEE Journal of Solid-State Circuits, 1975