A Procedure for Placement of Standard-Cell VLSI Circuits
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper describes a method of automatic placement for standard cells (polycells) that yields areas within 10-20 percent of careful hand placements. The method is based on graph partitioning to identify groups of modules that ought to be close to each other, and a technique for properly accounting for external connections at each level of partitioning. The placement procedure is in production use as part of an automated design system; it has been used in the design of more than 40 chips, in CMOS, NMOS, and bipolar technologies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Self-citationA Linear-Time Heuristic for Improving Network Partitions
Fiduccia, C. M., & Mattheyses, R. M. (1982) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1982.1585498 · Cited by 2,567
A forced directed component placement procedure for printed circuit boards
Quinn, N., & Breuer, M. (1979) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1979.1084652 · Cited by 263
Cited by
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
A multilevel algorithm for partitioning graphs
Hendrickson, B., & Leland, R. (1995) · Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '95 · doi:10.1145/224170.224228 · Cited by 1,069
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
A graph placement methodology for fast chip design
Mirhoseini, A., Goldie, A., Yazgan, M., Jiang, J. W., Songhori, E., Wang, S., Lee, Y.-J., Johnson, E., Pathak, O., Nova, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03544-w · Cited by 618
Graph partitioning models for parallel computing
Hendrickson, B., & Kolda, T. G. (2000) · Parallel Computing · doi:10.1016/s0167-8191(00)00048-x · Cited by 461
VLSI cell placement techniques
Shahookar, K., & Mazumder, P. (1991) · ACM Computing Surveys · doi:10.1145/103724.103725 · Cited by 308
Simple Local Search Problems that are Hard to Solve
Schäffer, A. A. (1991) · SIAM Journal on Computing · doi:10.1137/0220004 · Cited by 291
Boettcher, S., & Percus, A. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00007-2 · Cited by 278
Wiring considerations in analog VLSI systems, with application to field-programmable networks
Sivilotti, M. A. (2007) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/stj4-kh72 · Cited by 273
Metadata
- Authors
- Dunlop, A. E., & Kernighan, B. W.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1985-01
- Volume
- 4
- Issue
- 1
- Pages
- 92-98
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W1980746862
- Cited by
- 505
- References
- 4
- FWCI
- 15.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.