Introduction to VLSI Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '83 Proceedings of the 20th Design Automation Conference
An optimum channel-routing algorithm for polycell layouts of integrated circuits
DAC '73 Proceedings of the 10th Design Automation Workshop
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
DAC '82 Proceedings of the 19th Design Automation Conference
Optimal Wiring of Movable Terminals
IEEE Transactions on Computers
Efficient Algorithms for Channel Routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Global Wiring by Simulated Annealing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Dogleg Channel Routing is NP-Complete
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A New Symbolic Channel Router: YACR2
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this paper the channel routing problem is generalized to allow the interchange of some of the pins in the channel. The generalized problem is called the Permutation Channel Routing Problem (PCRP). This model arises naturally when there are logically equivalent (and therefore interchangeable) pins. Various other applications of the model are also presented. We show that the PCRP is NP-complete for two different cost measures. An optimal algorithm is presented for a special case called the Single Permutable Block Model. For the general PCRP, we study two methods of solution: iterative improvement and simulated annealing. Our results show that allowing some of the pins to be interchanged can lead to a substantial reduction in the number of tracks needed for routing. For example, by randomly generating a few small groups of interchangeable pins, a savings of 42% was obtained for Deutsch's Difficult problem. For all the test problems, our algorithms produce results that are very close to the best possible ones. We also show that our algorithms outperform a previous method by Kobayashi and Drozd.