An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing

Author

Yan, Jin-Tai

Author_Institution

Comput. Syst. Res. Center, Nat. Chiao Tung Univ., Hsinchu, Taiwan

Volume

18

Issue

2

fYear

1999

fDate

2/1/1999 12:00:00 AM

Firstpage

163

Lastpage

171

Abstract

It is well known that a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel. To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chaudhary´s O(kn²) heuristic algorithm (1991) and Chen´s O(k²n) optimal algorithm (1994) have been, respectively, proposed, where it is the number of terminals and k is the number of routing tracks in a channel. However, the time complexity of the two algorithms is in O(n³) time in the worst case. In this paper, based on optimality-oriented swap-direction selection in an optimal bubble-sorting solution, an improved optimal algorithm for a BSNMCR problem is proposed, and the time complexity of the proposed algorithm is proven to be in O(kn) time and in O(n²) time in the worst case

Keywords

circuit CAD; circuit optimisation; network routing; sorting; BSNMCR problem; bubble sorting; nonManhattan channel routing; optimal algorithm; time complexity; Algorithm design and analysis; Chromium; Design automation; Fabrication; Heuristic algorithms; Routing; Sorting; Very large scale integration; Wires;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.743726

Filename

743726