A new rip-up and reroute algorithm for very large scale gate arrays

Abstract

A fast rip-up and reroute algorithm for large scale gate arrays is reported. The algorithm combines 'global' and 'local' rip-up and reroute processes to efficiently eliminate the unconnects introduced by an initial routing process. The global process reduces the local wire congestion by ripping up and rerouting global paths. The local process eliminates the unconnects, mainly caused by routing order dependency, by ripping up and rerouting local paths. The effectiveness of our method is demonstrated by our experimental results on industrial sea-of-gates (SOG) circuits and a well-known benchmark circuit.