Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning

Journal of Heuristics

Volumn 3, Issue 3, 1997, Pages 225-243

  Shi, C J ^a   Vannelli, A ^b   Vlach, J ^b  

^a University of Iowa   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DIGITAL CIRCUITS; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PRINTED CIRCUIT BOARDS;

PATH CONSTRAINED HYPERGRAPH PARTITIONING; PERFORMANCE DRIVEN LAYER ASSIGNMENT;

INTEGRATED CIRCUIT LAYOUT;

EID: 0031275941     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009683110027     Document Type: Article

References (33)

1. Ahn, K. and S. Sahni. (1993). "Constrained Via Minimization," IEEE Trans. on Computer-Aided Design 12(2), 273-282.
2. Barahona, F. (1990). "On Via Minimization," IEEE Trans. on Circuits and Systems CAS-37(4), 527-530.
3. Barahona, F., M. Grötschel, M. Jünger, and G. Reinelt. (1988). "An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Problem," Operations Research 36(3), 493-513.
4. Chang, K.C. and D.H.-C. Du. (1987). "Efficient Algorithms for Layer Assignment Problem," IEEE Trans. on Computer-Aided Design CAD-6(1), 67-78.
5. Chen, R.W., Y. Kajitani, and S.P. Chan. (1983). "A Graph-Theoretic via Minimization Algorithm for Two-Layer Printed Boards," IEEE Trans. on Circuits and Systems CAS-30(5), 284-299.
6. Ciesielski, M.J. (1989). "Layer Assignment for VLSI Interconnect Delay Minimization," IEEE Trans. on Computer-Aided Design CAD-8(6), 702-707.
7. Ciesielski, M.J. and E. Kinnen. (1981). "An Optimum Layer Assignment for Routing in ICs and PCBs." Proc. of IEEE/ACM Design Automation Conf., pp. 733-737.
8. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. (1992). CPLEX Optimization, Inc.
9. Choi, H.-A., K. Nakajima, and C.S. Rim. (1989). "Graph Bipartition and Via Minimization," SIAM J. Disc. Math. 2, 38-47.
10. Elmore, W. (1948) "The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers," Journal of Applied Physics 19, 55-63.
11. Fiduccia, C.M. and R.M. Mattheyses. (1982). "A Linear-Time Heuristic for Improving Network Partitions." Proc. of IEEE/ACM Design Automation Conf., pp. 175-181.
12. Gopal, I.S., D. Coppersmith, and C.K. Wong. (1983). "Optimal Wiring of Movable Terminals," IEEE Trans. on Computers, C-32(9), 845-858.
13. Hashimoto, A. and J. Stevens. (1971). "Wire Routing Optimizing Channel Assignment Within Large Aperture." Proc. of 8th Design Automation Workshop, pp. 155-169.
14. Hsu, C.P. (1983). "Minimum-via Topological Routing," IEEE Trans. on Computer-Aided Design CAD-2(4), 235-246.
15. Joy, D.A. and M.J. Ciesielski. (1992). "Layer Assignment for Printed Circuit Boards and Integrated Circuits." Proceedings of the IEEE, vol. 80, no. 2.
16. Kuo, Y.S., T.C. Chern, and W.K. Shih. (1988). "Fast Algorithm for Optimal Layer Assignment." Proc. of IEEE/ACM Design Automation Conf., pp. 554-559.
17. McGeer, RC. and R.K. Brayton. (1989). "Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network." Proc. of IEEE/ACM Design Automation Conf., pp. 561-567.
18. Naclerio, N.J., S. Masuda, and K. Nakajima. (1989). "The Via Minimization Problem is NP-complete," IEEE Trans. Computers C-38(11), 1604-1608.
19. Pinter, R.Y. (1982). "Optimal Layer Assignment for Interconnect." Proc. of IEEE Circuits and Computers Conference, pp. 398-401.
20. Rubinstein, J., P. Penfield, and M. A. Horowitz. (1982). "Signal Delay in RC Networks," IEEE Trans. on Computer-Aided Design, 202-210.
21. Sanchis, L.A. (1989). "Multiple-Way Network Partitioning," IEEE Trans. on Computers 38(1), 62-88.
22. Shi, C.-J. (1992). "A Signed Hypergraph Model of Constrained Via Minimization." Proc. Second Great Lakes Symp. on VLSI, pp. 159-166.
23. Shi, C.-J. (1993a). "Constrained Via Minimization and Signed Hypergraph Partitioning." In D.T. Lee and M. Sarrafzadeh (eds.), Algorithmic Aspects of VLSI Layouts, pp. 337-356. World Scientific Publishing Company.
24. Shi, C.-J. (1993b). "Analysis, Sensitivity and Macromodeling of the Elmore Delay in Linear Networks for Performance-Driven VLSI Design," International Journal of Electronics 75(3), 467-484.
25. Shi, C.-J., A. Vannelli, and J. Vlach. (1990). "A Hypergraph Partitioning Approach to the Via Minimization Problem." Proc. 1990 Canadian Conf. on VLSI, pp. 2.7.1-2.7.8.
26. Shi, C.-J., and K. Zhang. (1987). "A Robust Approach to Timing Verification." Proc. IEEE Int. Conf. Computer-Aided Design, pp. 56-59.
27. Stevens, K.R. and W.M. vanCleemput. (1979). "Global Via Minimization in Generalized Routing Environment." Proc. IEEE Int. Symp. on Circuits and Systems, pp. 689-692.
28. Vlach, J., J. Barby, A. Vannelli, I. Talkhan, and C.-J. Shi. (1991). "Group Delay as an Estimate of Delay in Logic," IEEE Trans. on Computer-Aided Design CAD-10(7), 949-953.
29. Weste, N. and K. Eshraghian. (1985). Principles of CMOS VLSI Design: A System Perspective, Addison-Wesley Publishing Company.
30. Wolf, W.H. and A.E. Dunlop. (1988). "Symbolic Layout and Compaction." In B. Breas and M. Lorenzetti (eds.), Physical Design Automation of VLSI Systems. Chap. 6. Menlo Park: Benjamin/Cummings.
31. Xiong, X.M. and E.S. Kuh. (1989). "A Unified Approach to the Via Minimization Problem," IEEE Trans. on Circuits and Systems CAS-36(2), 190-204.
32. Yen, S.H.C., D.H.C. Du, and S. Ghanta. (1989). "Efficient Algorithms for Extracting the K Most Critical Paths in Timing Analysis." Proc. of IEEE/ACM Design Automation Conf., pp. 649-654.
33. Yoshimura, T. and E.S. Kuh. (1982). "Efficient Algorithms for Channel Routing," IEEE Trans. on Computer-Aided Design CAD-1(1), 25-35.