Liming-constrained congestion-driven global routing

Abstract

It is well known that congestion control becomes more and more important in modern grid-based routing process. In this paper, a timing-constrained congestion-driven global routing approach is proposed to obtain initial congestion-driveu global routing resnlt without destroying the timing constraint of any routing net, and a post-processing simulated-annealing. based rip-up-and-reroute improvement is proposed to release the congestion of the grid edges. As mentioned in experimental results, the proposed TCGR+STRR algorithm can obtain near 100% global rontability in congestion control for the tested benchmark cirmits.