|
Dynamic Bound Generation for Constraint-Driven Routing
Abstract:
We propose a technique to update dynamically the bounds used
during constraint-driven routing. Moderate bound violations are
allowed as long as no constraint violations are induced.
Adaptive net scheduling is made possible during routing, so that nets
requiring an implementation with large parasitics can take
advantage of the margin made available to them by other
parameters maintained within their own bounds. The user is provided
with a quantitative evaluation of the
effectiveness of the tool in enforcing the set of constraints on the
|
