
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J.S. Wang, R.C.T. Lee, "An Efficient Channel Routing Algorithm to Yield an Optimal Solution," IEEE Transactions on Computers, vol. 39, no. 7, pp. 957962, July, 1990.  
BibTex  x  
@article{ 10.1109/12.55698, author = {J.S. Wang and R.C.T. Lee}, title = {An Efficient Channel Routing Algorithm to Yield an Optimal Solution}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {7}, issn = {00189340}, year = {1990}, pages = {957962}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.55698}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Efficient Channel Routing Algorithm to Yield an Optimal Solution IS  7 SN  00189340 SP957 EP962 EPD  957962 A1  J.S. Wang, A1  R.C.T. Lee, PY  1990 KW  channel routing algorithm; optimal solution; VLSI design; heuristics; dominance rules; searching tree; Pascal; VAX 11/750 computer; circuit layout CAD; trees (mathematics); VLSI. VL  39 JA  IEEE Transactions on Computers ER   
An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal solution for the channel routing problem in VLSI design. The algorithm is an A* algorithm with good heuristics and dominance rules for terminating unnecessary nodes in the searching tree. Experimental results, agreeing with theoretical analysis, show that it behaves quite well in average cases. An optimal solution is obtained for the Deutsch difficult case in 5.5minCPU time after the algorithm is implemented in Pascal and run on a VAX 11/750 computer.
[1] M. Burstein and R. Pelavin, "Hierarchical channel router," inProc. 20th Design Automat. Conf., 1983, pp. 591597.
[2] D. N. Deutsch, "A dogleg channel router," inProc. 20th Design Automat. Conf., 1976, pp. 425433.
[3] R. P. Dilworth, "A decomposition theorem for partially ordered sets,"Ann. Math., vol. 51, no. 2, pp. 161166, 1950.
[4] P. C. Gilmore and A. J. Hoffman, "Characterizations of comparability and interval graphs,"Abstract Int. Congress Math., Stockholm, 1964, pp. 2929.
[5] A. Hashimoto and J. Stevens, "Wire routing by optimizing channel assignment within large apertures," inProc. Design Automat. Workshop, 1971, pp. 155169.
[6] T. Ibaraki, "The power of dominance relations in branchandbound algorithms,"J. ACM, vol. 24, no. 2, pp. 264279, 1977.
[7] B. W. Kernighan, D. G. Schweikert, and G. Persky, "An optimum channelrouting algorithm for polycell layouts of integrated circuits," inProc. 10th Design Automat. Workshop, 1973, pp. 5055.
[8] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[9] A. S. LaPaugh, "Algorithms for integrated circuit layout: Analytic approach," Ph.D. dissertation, MIT Lab Comput. Sci., Nov. 1980.
[10] T. Morin and R. Marsten, "'Branchandbound strategies for dynamic programming,"Oper. Res., vol. 24, pp, 611627, 1976.
[11] N. Nilsson,ProblemSolving Methods in Artificial Intelligence. New York: McGrawHill, 1971.
[12] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[13] C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: PrenticeHall, 1982.
[14] J. Pearl,Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Mass: AddisonWesley, 1984.
[15] F. Preparata and R. Yeh,Introduction to Discrete Structures: for Computer Science and Engineer. Reading, MA: AddisonWesley, 1973.
[16] T. G. Szymanski, "Dogleg channel routing is NPcomplete,"IEEE Trans. Comput.Aided Design, vol. CAD4, no. 1, pp. 3141, 1985.
[17] J. S. Wang, "An efficient algorithm to yield an optimal solution for the channel routing problem in VLSI," Ph.D. dissertation, Instit. of Comput. and Decision Sci., National Tsing Hua University, Hsinchu Taiwan, Republic of China, 1986.
[18] T. Yoshimura and E. S. Kuh, "Efficient algorithms for channel routing,"IEEE Trans. Comput.Aided Design, vol. CAD1, no. 1, pp. 2535, 1982.