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

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

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/sup 2/) heuristic algorithm (1991) and Chen's O(k/sup 2/...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 1999-02, Vol.18 (2), p.163-171
1. Verfasser: YAN, J.-T
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Algorithms
Applied sciences
Channels
Chromium
Complexity
Computer aided design
Design automation
Design engineering
Design. Technologies. Operation analysis. Testing
Electronics
Exact sciences and technology
Fabrication
Heuristic algorithms
Integrated circuits
Optimization
Routers
Routing
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Sorting
Terminals
Very large scale integration
Wires
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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/sup 2/) heuristic algorithm (1991) and Chen's O(k/sup 2/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/sup 3/) 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/sup 2/) time in the worst case.
ISSN:0278-0070
1937-4151
DOI:10.1109/43.743726