A faster approximation algorithm for the Steiner problem in graphs
Acta Informatica
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Graph Theory With Applications
Graph Theory With Applications
SEFOP: a novel approach to data path module placement
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A new generalized row-based global router
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
System-level routing of mixed-signal ASICs in WREN
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic
EDTC '97 Proceedings of the 1997 European conference on Design and Test
| Hi-index | 0.00 |
We present a new graph-based macro cell global router. The placement of the macro cells need not have the slicing structure and the macro cells may have any rectilinear shape. A key contribution is a new algorithm which efficiently generates M shortest routes for every net. The global router then selects one route for each net while seeking to avoid the net routing-order dependence problem. Mickey has two different objective functions, making it applicable to different design styles. It can be used to either minimize the chip area or to minimize the total wire length under channel capacity constraints. Test results on industrial circuits show that Mickey outperforms existing approaches.