Skip to main content
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Performance-driven physical layout design is becoming increasingly important for both high speed integrated circuits and printed circuit boards. This paper studies the problem of assigning wire segments into two layers so as to minimize the number of vias, while taking into account performance constraints such as layer preference and circuit timing. We show that using the Elmore delay model, three timing problems in synchronous digital circuits—the long path problem, the short path problem and the time skew problem—can be formulated as a set of linear inequalities. We use the model of signed hypergraph to represent two-layer routings and formulate the performance-driven optimum layer assignment problem as the path-constrained maximum balance problem in a signed hypergraph. Two solution methods are developed and implemented. First, an integer linear programming formulation is derived for finding exact solutions. Second, a local-search heuristic for hypergraph partitioning is extended to cope with path-inequality constraints. Experimental results on a set of layer-assignment benchmarks demonstrated that the path-constrained local-search heuristic achieves optimum or near-optimum solutions with several orders of magnitude faster than the integer linear programming approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahn, K. and S. Sahni. (1993). "Constrained Via Minimization," IEEE Trans. on Computer-Aided Design 12(2), 273–282.

    Article  Google Scholar 

  • Barahona, F. (1990). "On Via Minimization," IEEE Trans. on Circuits and Systems CAS-37(4), 527–530.

    Article  MathSciNet  Google Scholar 

  • 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.

    Article  MATH  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  MATH  Google Scholar 

  • Ciesielski, M.J. (1989). "Layer Assignment for VLSI Interconnect Delay Minimization," IEEE Trans. on Computer-Aided Design CAD-8(6), 702–707.

    Article  Google Scholar 

  • 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. Using the CPLEX Callable Library and CPLEX Mixed Integer Library.(1992). CPLEX Optimization, Inc.

  • Choi, H.-A., K. Nakajima, and C.S. Rim. (1989). "Graph Bipartition and Via Minimization," SIAM J. Disc. Math. 2, 38–47.

    Article  MathSciNet  MATH  Google Scholar 

  • Elmore, W. (1948) "The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers," Journal of Applied Physics 19, 55–63.

    Article  Google Scholar 

  • 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.

  • Gopal, I.S., D. Coppersmith, and C.K. Wong. (1983). "Optimal Wiring of Movable Terminals," IEEE Trans. on Computers, C-32(9), 845–858.

    Article  MATH  Google Scholar 

  • Hashimoto, A. and J. Stevens. (1971). "Wire Routing Optimizing Channel Assignment Within Large Aperture." Proc. of 8th Design Automation Workshop, pp. 155–169.

  • Hsu, C.P. (1983). "Minimum-via Topological Routing," IEEE Trans. on Computer-Aided Design CAD-2(4), 235–246.

    Article  Google Scholar 

  • 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.

  • 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.

  • McGeer, P.C. 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.

  • Naclerio, N.J., S. Masuda, and K. Nakajima. (1989). "The Via Minimization Problem is NP-complete," IEEE Trans. Computers C-38(11), 1604–1608.

    Article  Google Scholar 

  • Pinter, R.Y. (1982). "Optimal Layer Assignment for Interconnect." Proc. of IEEE Circuits and Computers Conference, pp. 398–401.

  • Rubinstein, J., P. Penfield, and M.A. Horowitz. (1982). "Signal Delay in RC Networks," IEEE Trans. on Computer-Aided Design, 202–210.

  • Sanchis, L.A. (1989). "Multiple-Way Network Partitioning," IEEE Trans. on Computers 38(1), 62–88.

    Article  MATH  Google Scholar 

  • Shi, C.-J. (1992). "A Signed Hypergraph Model of Constrained Via Minimization." Proc. Second Great Lakes Symp. on VLSI, pp. 159–166.

  • 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.

  • 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.

    Article  Google Scholar 

  • 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.

  • Shi, C.-J., and K. Zhang. (1987). "A Robust Approach to Timing Verification." Proc. IEEE Int. Conf. Computer-Aided Design, pp. 56–59.

  • 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.

  • 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 DesignCAD-10(7), 949–953.

    Article  Google Scholar 

  • Weste, N. and K. Eshraghian. (1985). Principles of CMOS VLSI Design: A System Perspective, Addison-Wesley Publishing Company.

  • 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.

    Google Scholar 

  • Xiong, X.M. and E.S. Kuh. (1989). "A Unified Approach to the Via Minimization Problem," IEEE Trans. on Circuits and SystemsCAS-36(2), 190–204.

    Article  MathSciNet  Google Scholar 

  • Yen, S.H.C., D.H.C. Du, and S. Ghanta. (1989). "Efficient Algorithms for Extracting the KMost Critical Paths in Timing Analysis." Proc. of IEEE/ACM Design Automation Conf., pp. 649–654.

  • Yoshimura, T. and E.S. Kuh. (1982). "Efficient Algorithms for Channel Routing," IEEE Trans. on Computer-Aided DesignCAD-1(1), 25–35.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, CJ., Vannelli, A. & Vlach, J. Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning. Journal of Heuristics 3, 225–243 (1997). https://doi.org/10.1023/A:1009683110027

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009683110027

Keywords

Navigation