RIVER ROUTING EVERY WHICH WAY, BUT LOOSE.

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

Abstract

The authors treat the DRH (detailed routing given a homotopy) problem, which deals with the placement of a set of rectangular modules within a bounding box, numbered terminals on the modules' boundaries, and a homotopy (rough routing) specification for each net. The problem is to determine whether there is a one-layer detailed routing for this configuration that conforms to the given homotopy. It is shown how to solve DRH in O(n plus m log m plus D(m)) operations. The solution uses n plus m log m homotopy queries that are elementary; they are answerable based solely on local properties of modules, terminals, and wire connections. In addition, O(m) more complex queries are needed, and these are represented in the D(m) term. These queries must account for the total number of crossings occurring for selected test segments.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages65-73
Number of pages9
ISBN (Print)081860591X
StatePublished - 1984

Fingerprint

Rivers
Wire
Specifications

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Cole, R., & Siegel, A. (1984). RIVER ROUTING EVERY WHICH WAY, BUT LOOSE. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 65-73). IEEE.

RIVER ROUTING EVERY WHICH WAY, BUT LOOSE. / Cole, Richard; Siegel, Alan.

Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1984. p. 65-73.

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

Cole, R & Siegel, A 1984, RIVER ROUTING EVERY WHICH WAY, BUT LOOSE. in Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, pp. 65-73.
Cole R, Siegel A. RIVER ROUTING EVERY WHICH WAY, BUT LOOSE. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1984. p. 65-73
Cole, Richard ; Siegel, Alan. / RIVER ROUTING EVERY WHICH WAY, BUT LOOSE. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1984. pp. 65-73
@inproceedings{b92216b2fd1140e19eadd0bf28731f88,
title = "RIVER ROUTING EVERY WHICH WAY, BUT LOOSE.",
abstract = "The authors treat the DRH (detailed routing given a homotopy) problem, which deals with the placement of a set of rectangular modules within a bounding box, numbered terminals on the modules' boundaries, and a homotopy (rough routing) specification for each net. The problem is to determine whether there is a one-layer detailed routing for this configuration that conforms to the given homotopy. It is shown how to solve DRH in O(n plus m log m plus D(m)) operations. The solution uses n plus m log m homotopy queries that are elementary; they are answerable based solely on local properties of modules, terminals, and wire connections. In addition, O(m) more complex queries are needed, and these are represented in the D(m) term. These queries must account for the total number of crossings occurring for selected test segments.",
author = "Richard Cole and Alan Siegel",
year = "1984",
language = "English (US)",
isbn = "081860591X",
pages = "65--73",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",

}

TY - GEN

T1 - RIVER ROUTING EVERY WHICH WAY, BUT LOOSE.

AU - Cole, Richard

AU - Siegel, Alan

PY - 1984

Y1 - 1984

N2 - The authors treat the DRH (detailed routing given a homotopy) problem, which deals with the placement of a set of rectangular modules within a bounding box, numbered terminals on the modules' boundaries, and a homotopy (rough routing) specification for each net. The problem is to determine whether there is a one-layer detailed routing for this configuration that conforms to the given homotopy. It is shown how to solve DRH in O(n plus m log m plus D(m)) operations. The solution uses n plus m log m homotopy queries that are elementary; they are answerable based solely on local properties of modules, terminals, and wire connections. In addition, O(m) more complex queries are needed, and these are represented in the D(m) term. These queries must account for the total number of crossings occurring for selected test segments.

AB - The authors treat the DRH (detailed routing given a homotopy) problem, which deals with the placement of a set of rectangular modules within a bounding box, numbered terminals on the modules' boundaries, and a homotopy (rough routing) specification for each net. The problem is to determine whether there is a one-layer detailed routing for this configuration that conforms to the given homotopy. It is shown how to solve DRH in O(n plus m log m plus D(m)) operations. The solution uses n plus m log m homotopy queries that are elementary; they are answerable based solely on local properties of modules, terminals, and wire connections. In addition, O(m) more complex queries are needed, and these are represented in the D(m) term. These queries must account for the total number of crossings occurring for selected test segments.

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

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

M3 - Conference contribution

AN - SCOPUS:0021566367

SN - 081860591X

SP - 65

EP - 73

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -