Title :
River Routing Every Which Way, But Loose
Author :
Cole, Richard ; Siegel, Alan
Author_Institution :
New York University
Abstract :
A solution to the \´Detailed Routing given a Homotopy\´ (DRH) problem is given in O(n + mlogm + D(m)) operations. The solution uses n + mlogm homotopy queries that are elementary; they are answerable based solely on "local properties" of modules, terminals, and wire connections. In addition, we need O(m) more complex queries, which are represented in the D(m) term. These queries must account for the total number of crossin s occurringfor selected test segments.
Keywords :
Design methodology; Integrated circuit interconnections; Joining processes; Lattices; Rivers; Routing; Very large scale integration; Wires; Wiring;
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
Conference_Location :
Singer Island, FL
Print_ISBN :
0-8186-0591-X
DOI :
10.1109/SFCS.1984.715902
