A progressive two-stage global routing for macro-cell based designs

We propose a two-stage global routing algorithm based on mixed integer programming and a novel network-flow model. Results from various test cases including a subset of routes on a commercial 64-bit microprocessor core show that our method outperforms commercial CCT router. On average, we achieved 29% less delay violations, 40% less repeater usage on resulting routing-trees, 20% less maximum delay violation and better congestion distribution.