loading...
On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing
The State University of New York at Buffalo March 16-March 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1995.516053Fifth Great Lakes Symposium on VLSI ( ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
A.D. Johnson, "On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing," Great Lakes Symposium on VLSI, pp. 204, Fifth Great Lakes Symposium on VLSI (GLSVLSI'95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/GLSV.1995.516053,
author = {A.D. Johnson},
title = {On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing},
journal ={Great Lakes Symposium on VLSI},
volume = {0},
year = {1995},
issn = {1066-1395},
pages = {204},
doi = {http://doi.ieeecomputersociety.org/10.1109/GLSV.1995.516053},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Great Lakes Symposium on VLSI
TI - On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing
SN - 1066-1395
SP
EP
A1 - A.D. Johnson,
PY - 1995
KW - network routing; circuit layout CAD; integrated circuit layout; graph theory; VLSI; locally optimal breaking strategy; nondisjoint cyclic vertical constraints; VLSI channel routing; vertical constraint graph; nondisjoint circuits; common vertex; common path; channel router heuristics; automatic routers; interactive routers; parallel architectures
VL - 0
JA - Great Lakes Symposium on VLSI
ER -
 
A.D. Johnson, Dept. of Electr. Eng., Toledo Univ., OH, USA
Locally optimal breaking strategy was already developed for disjoint directed circuits in the vertical constraint graph. The paper reports extensions to two classes of nondisjoint circuits: with a common vertex, and with a common path. The significance of this is that the demonstration of general applicability of the locally optimal breaking concept opens a new approach to improving the channel router heuristics for automatic and interactive routers, using parallel architectures.
Index Terms:
network routing; circuit layout CAD; integrated circuit layout; graph theory; VLSI; locally optimal breaking strategy; nondisjoint cyclic vertical constraints; VLSI channel routing; vertical constraint graph; nondisjoint circuits; common vertex; common path; channel router heuristics; automatic routers; interactive routers; parallel architectures
Citation:
A.D. Johnson, "On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing," glsvlsi, pp.204, Fifth Great Lakes Symposium on VLSI (GLSVLSI'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.