Abstract
Detailed routing is a crucial task in physical design of VLSI chips. Many routing algorithms have been proposed and most of them, besides the maze and line search, are oriented towards handling specified detailed routing tasks. In this paper, we discuss routing strategies for switch box problems. Switch boxes are closed, rectilinear regions with terminals on all of their sides. They create the most difficult detailed routing tasks. Here, we discuss problems which make switch box routing so difficult and give an overview of representative heuristics for solving it.
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.
