| Summary: | 碩士 === 國立清華大學 === 資訊工程學系 === 95 === In this thesis, we present a new global routing algorithm for modern designs. Our algorithm is based on iterative rip-ups and reroutes, and several techniques are proposed to enhance our global router. These techniques include (1) a history based cost function which helps to distribute overflow during iterative rip-ups and reroutes, (2) an adaptive multi-source multi-sink maze routing method to improve the wirelength of maze routing, (3) a congested region identification method to specify the order for nets to be ripped up and rerouted, and (4) a post processing technique to further reduce overflow when iterative history based rip-ups and reroutes reach bottleneck. Compared with state-of-the-art works on ISPD98 benchmarks, our router outperforms them in both overflow and wirelength. For the much larger designs from the ISPD07 benchmark suite, our solution quality is better than the best results reported in the ISPD07 routing contest, showing that our algorithm is highly scalable for modern designs.
|
|---|
