Sciweavers

GLVLSI
2000
IEEE

A novel technique for sea of gates global routing

13 years 8 months ago
A novel technique for sea of gates global routing
We present a novel global routing and cross-point assignment methodology for sea-of-gates (SOG) designs. Using the proposed congestion driven spanning trees (CDST), and continuously analyzing the congestion at all steps, nets are incrementally globally routed in one of the six well thought of heuristic steps of our methodology. This eliminates the need for rip-up and re-route and enables our approach to achieve good completion rates. We tested our flow on a number of testcases from the industry. The net lengths produced by our flow were compared to the theoretical lower-bound (steiner tree) and were found to be at most 4% worse. We compared the results of creating the net segments by the classical MST verses the CDST and observed an 80% improvement in the number of incomplete nets. Completing the detailed routing using a commercially available detailed router validated the results of the proposed global routing and crosspoint assignment.
Bharat Krishna, C. Y. Roger Chen, Naresh Sehgal
Added 31 Jul 2010
Updated 31 Jul 2010
Type Conference
Year 2000
Where GLVLSI
Authors Bharat Krishna, C. Y. Roger Chen, Naresh Sehgal
Comments (0)