Name
Abstract | ||
|---|---|---|
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 cross-point assignment. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/330855.330976 | ACM Great Lakes Symposium on VLSI |
Keywords | Field | DocType |
novel technique,gates global routing,proposed congestion,good completion rate,incomplete net,cross-point assignment methodology,proposed global routing,detailed routing,novel global routing,classical mst,cross-point assignment,available detailed router,spanning tree,steiner tree,verification,socs,lower bound,design,mems | Heuristic,Sea of gates,Steiner tree problem,Computer science,Static routing,Algorithm,Real-time computing,Spanning tree,Router | Conference |
ISBN | Citations | PageRank |
1-58113-251-4 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishna A. Bharat | 1 | 1211 | 252.86 |
| C. Y. Roger Chen | 2 | 0 | 0.34 |
| Naresh K. Sehgal | 3 | 2 | 1.64 |