3 search results - page 1 / 1 » On the Bounded-Skew Clock and Steiner Routing Problems |
DAC
1995
ACM
13 years 8 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
ICCAD
1999
IEEE
13 years 9 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
ICCAD
1995
IEEE
13 years 8 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...