Abstract
We present a very fast area router for MCM design. Given a set of nets and a routing area, it repeatedly routes as many nets as possible in two layers selected from top to bottom until all the nets are routed. The router uses a line sweep technique and a simple net selection algorithm. By using e cient data structures and a novel priority scheme, the routing can be nished in time almost proportional to the routing area. For the benchmark circuits, the proposed router generates comparable routing results faster by over an order of magnitude (18 times on the average) than the previously reported best router.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
