3 search results - page 1 / 1 » Minimum-Cost Bounded-Skew Clock Routing |
ISCAS
1995
IEEE
13 years 8 months ago
1995
IEEE
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
DAC
1997
ACM
13 years 9 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
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...