Title :
Dynamic bound generation for constraint-driven routing
Author :
Malavasi, Enrico ; Sangiovanni-Vincentelli, Alberto
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
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 given design
Keywords :
circuit layout CAD; circuit optimisation; constraint handling; integrated circuit layout; network routing; network topology; IC layout; adaptive net scheduling; bound violations; circuit optimisation; constraint-driven routing; dynamic bound generation; large parasitics; quantitative evaluation; Adaptive scheduling; Cost function; Degradation; Dynamic scheduling; Meetings; Minimization; Processor scheduling; Routing; Scheduling algorithm; Timing;
Conference_Titel :
Custom Integrated Circuits Conference, 1995., Proceedings of the IEEE 1995
Conference_Location :
Santa Clara, CA
Print_ISBN :
0-7803-2584-2
DOI :
10.1109/CICC.1995.518228
