Optimal wiring between rectangles

Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options'include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981
PublisherAssociation for Computing Machinery
Pages312-317
Number of pages6
ISBN (Print)0897910419
DOIs
StatePublished - May 11 1981
Event13th Annual ACM Symposium on Theory of Computing, STOC 1981 - Milwaukee, United States
Duration: Jun 11 1981Jun 13 1981

Other

Other13th Annual ACM Symposium on Theory of Computing, STOC 1981
CountryUnited States
CityMilwaukee
Period6/11/816/13/81

Fingerprint

Electric wiring
Wire
VLSI circuits
Polynomials

ASJC Scopus subject areas

  • Software

Cite this

Dolev, D., Karplus, K., Siegel, A., Strong, A., & Ullman, J. D. (1981). Optimal wiring between rectangles. In Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981 (pp. 312-317). Association for Computing Machinery. https://doi.org/10.1145/800076.802484

Optimal wiring between rectangles. / Dolev, Danny; Karplus, Kevin; Siegel, Alan; Strong, Alex; Ullman, Jeffrey D.

Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981. Association for Computing Machinery, 1981. p. 312-317.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dolev, D, Karplus, K, Siegel, A, Strong, A & Ullman, JD 1981, Optimal wiring between rectangles. in Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981. Association for Computing Machinery, pp. 312-317, 13th Annual ACM Symposium on Theory of Computing, STOC 1981, Milwaukee, United States, 6/11/81. https://doi.org/10.1145/800076.802484
Dolev D, Karplus K, Siegel A, Strong A, Ullman JD. Optimal wiring between rectangles. In Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981. Association for Computing Machinery. 1981. p. 312-317 https://doi.org/10.1145/800076.802484
Dolev, Danny ; Karplus, Kevin ; Siegel, Alan ; Strong, Alex ; Ullman, Jeffrey D. / Optimal wiring between rectangles. Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981. Association for Computing Machinery, 1981. pp. 312-317
@inproceedings{57bc0a62bfc146a4970b78ac6891ea1f,
title = "Optimal wiring between rectangles",
abstract = "We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options'include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.",
author = "Danny Dolev and Kevin Karplus and Alan Siegel and Alex Strong and Ullman, {Jeffrey D.}",
year = "1981",
month = "5",
day = "11",
doi = "10.1145/800076.802484",
language = "English (US)",
isbn = "0897910419",
pages = "312--317",
booktitle = "Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Optimal wiring between rectangles

AU - Dolev, Danny

AU - Karplus, Kevin

AU - Siegel, Alan

AU - Strong, Alex

AU - Ullman, Jeffrey D.

PY - 1981/5/11

Y1 - 1981/5/11

N2 - We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options'include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.

AB - We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options'include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.

UR - http://www.scopus.com/inward/record.url?scp=85023387204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023387204&partnerID=8YFLogxK

U2 - 10.1145/800076.802484

DO - 10.1145/800076.802484

M3 - Conference contribution

SN - 0897910419

SP - 312

EP - 317

BT - Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981

PB - Association for Computing Machinery

ER -