Abstract
For a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chen's O(k2n) optimal algorithm and Yan's O(kn) optimal algorithm have been proposed respectively where n is the number of terminals and k is the number of routing tracks in a channel. For the sorting process of a given vector, these two optimal algorithms consider that a left-swap pass or a right-swap pass is an overall pass. As the distribution of most of the routing nets in a channel has a local property, a vector may be divided into several smaller subvectors, and each subvector can be sorted by a left-swap pass or a right-swap pass to further optimise the number of tracks in a channel. In the paper, based on an optimality-oriented swap-direction selection and a `divide-and-conquer' technology, a hierarchical BSNMCR (HBSNMCR) problem is formulated and an O(hn) optimal algorithm is proposed, where h is the number of routing tracks in a HBSNMCR solution, for h≤k.
Sign-in/Register to access full text options 
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 callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.
