Conjugate conflict continuation graphs for multi-layer constrained via minimization

Information Sciences

Volumn 177, Issue 12, 2007, Pages 2436-2447

  Lin, Rung Bin ^a   Chen, Shu Yu ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Graph coloring; Layer assignment; Routing; Via minimization; VLSI

Indexed keywords

ALGORITHMS; CONSTRAINED OPTIMIZATION; GRAPH THEORY; INTEGER PROGRAMMING; LOGIC DESIGN; PROBLEM SOLVING; SIMULATED ANNEALING; VLSI CIRCUITS;

CONSTRAINED VIA MINIMIZATION (CVM); GRAPH COLORING; INTEGER LINEAR PROGRAMMING (ILP); LAYER ASSIGNMENT;

MATHEMATICAL MODELS;

EID: 34047142680     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.01.013     Document Type: Article

References (32)

1. Barahona F. On via minimization. IEEE Transactions on Circuits and Systems 37 4 (1990) 527-530
2. Chang C.C., and Cong J. An efficient approach to multi-layer assignment with application to via minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18 5 (1999) 608-620
3. Chang K.C., and Du H.C. Layer assignment problem for three-layer routing. IEEE Transactions on Computers 37 5 (1988) 625-632
4. J.S. Cherng, S.J. Chen, C.-C. Tsai, J.M. Ho, An efficient approach for via minimization in multi-layer VLSI/PCB routing, in: Proc. IEEE Custom Integrated Circuit Conference, 1995, pp. 473-476.
5. Cho J.D., Raje S., and Sarrafzadeh M. Fast approximation algorithms on maxcut k-coloring and k-color ordering for VLSI applications. IEEE Transactions on Computers 47 11 (1998) 1253-1266
6. Y.C. Chou, Y.L. Lin, A graph-partitioning-based approach for multi-layer constrained via minimization, in: Proc. International Conference on Computer Aided Design, 1998, pp. 426-429.
7. S.C. Fang, K.E. Chang, W.S. Feng, S.J. Chen, Constrained via minimization with practical considerations for multi-layer VLSI/PCB routing problems, in: Proc. 28th ACM/IEEE Design Automation Conference, 1991, pp. 60-65.
8. Gan J.R., Wang X.G., and Lou Z.H. A multi-layer channel routing algorithm based on via minimization. Chinese Journal of Computers 25 8 (2002) 830-836
9. A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment with large apertures, in: Proc. 8th IEEE/ACM Design Automation Conference, 1971, pp. 155-169.
10. Hsu C.P. Minimum-via topological routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2 4 (1983) 235-246
11. Joy D.A., and Ciesielski M.J. Layer assignment for printed circuit boards and integrated circuits. Proceedings of the IEEE 80 2 (1992) 311-331
12. Y.S. Kuo, T.C. Chern, W.K. Shih, Fast algorithm for optimal layer assignment, in: Proc. 25th ACM/IEEE Design Automation Conference, 1988, pp. 554-559.
13. K.Y. Lee, T.C. Wang, Post-routing redundant via insertion for yield/reliability improvement, in: Proc. Asia and South Pacific Design Automation Conference, Yokohama, Japan, 2006, pp. 303-308.
14. F. Luo, Y. Jia, W. Dai, Yield-preferred via insertion based on novel geotopological technology, in: Proc. Asia and South Pacific Design Automation Conference, Yokohama, Japan, 2006, pp. 730-735.
15. Ma Q., and Yan X.L. Constrained via minimization with practical considerations for different-styled multi-layer routing. Acta Electronical Sinica 29 8 (2001) 1086-1089
16. Molitor P. A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization Integration. The VLSI Journal 15 1 (1993) 73-95
17. Naclerio N.J., Masuda S., and Nakajima K. The via minimization problem is NP-complete. IEEE Transactions on Computers 38 11 (1989) 1604-1608
18. R. Noteboom, H.H. Ali, A new graph coloring algorithm for constrained via minimization, in: Proc. 37th Midwest Symposium on Circuits and Systems, vol. 1, 1994, pp. 363-366.
19. Pinter R.Y. Optimal layer assignment for interconnect. Journal of VLSI and Computer Systems 1 2 (1984) 123-137
20. S. Raghvendra, P. Hurat, DFM: Linking design and manufacturing, in: Proc. 18th International Conference on VLSI Design, Kolkata, India, 2005, pp. 705-708.
21. C.J. Shi, Solving constrained via minimization by compact linear programming, in: Proc. Asia and South Pacific Design Automation Conference, 1997, pp. 635-640.
22. C.J. Shi, A signed hypergraph model of constrained via minimization, in: Proc. 2nd Great Lakes Symposium on VLSI, 1992, pp. 159-166.
23. K.R. Stevens, W.M. Van Cleemput, Global via elimination in a generalized routing environment, in: Proc. IEEE International Symposium on Circuits and Systems, 1979, pp. 689-692.
24. K. Takahashi, T. Watanabe, A heuristic algorithm to solve constrained via minimization for three-layer routing problems, in: Proc. IEEE International Symposium on Circuits and Systems, vol. 6, 1998, pp. 254-257.
25. Tang M., Chen L., and Chua H. A practical and efficient approach to the constrained via minimization problem. Computers and Electrical Engineering 27 (2001) 201-216
26. M. Tang, K. Eshraghian, H.N. Cheung, An efficient approach to constrained via minimization for two-layer VLSI routing, in: Proc. Asia and South Pacific Design Automation Conference, 1999, pp. 149-152.
27. M. Tang, An adaptive genetic algorithm for the minimal switching graph theorem, in: Proc. 5th European Conference on Evolutionary Computation in Combinatorial Optimization, Lausanne, Switzerland, 2005, pp. 224-233.
28. The K.S., Wong D.F., and Cong J. A layout modification approach to via minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10 4 (1991) 536-541
29. Tzeng W.G., and King G.H. Three-quarter approximation for the number of unused colors in graph coloring. Information Sciences 114 (1999) 105-126
30. D. Wu, J. Hu, R. Mahapatra, M. Zhao, Layer assignment for crosstalk risk minimization, in: Proc. Asia and South Pacific Design Automation Conference, Yokohama, Japan, 2004, pp. 159-162.
31. Wu D., Hu J., Mahapatra R., and Rabi N. Antenna avoidance in layer assignment. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25 4 (2006) 734-738
32. Xiong X.M., and Kuh E.S. A unified approach to the via minimization problem. IEEE Transactions on Circuits and Systems 36 2 (1989) 190-204