A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Modeling and minimization of routing congestion
2000
Proceedings of the 2000 conference on Asia South Pacific design automation - ASP-DAC '00
Abstract| Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is least understood, however, it models routability most accurately. In this paper, we study the congestion minimization problem during placement. First we pointed out that the bounding box router used in 12 is not an accurate measurement of the congestion in the placement. We use a realistic global router to evaluate congestion in the placement stage. This ensures that the nal
doi:10.1145/368434.368601
dblp:conf/aspdac/WangS00
fatcat:vz7nt5vewrhozj4plswlk5l6py