Principles of CMOS VLSI design: a systems perspective
Principles of CMOS VLSI design: a systems perspective
Multiple-Way Network Partitioning
IEEE Transactions on Computers
Graph bipartization and via minimization
SIAM Journal on Discrete Mathematics
Efficient algorithms for computing the longest viable path in a combinational network
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Efficient algorithms for extracting the K most critical paths in timing analysis
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
The Via Minimization Problem is NP-Complete
IEEE Transactions on Computers
Fast algorithm for optimal layer assignment
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
An optimum layer assignment for routing in ICs and PCBs.
DAC '81 Proceedings of the 18th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
Performance-driven physical layout design is becoming increasinglyimportant for both high speed integrated circuits and printed circuitboards. This paper studies the problem of assigning wire segments into twolayers so as to minimize the number of vias, while taking into accountperformance constraints such as layer preference and circuit timing. Weshow that using the Elmore delay model, three timing problems insynchronous digital circuits—the long path problem, the short pathproblem and the time skew problem—can be formulated as a set oflinear inequalities. We use the model of signed hypergraph to representtwo-layer routings and formulate the performance-driven optimum layerassignment problem as the path-constrained maximum balance problem in asigned hypergraph. Two solution methods are developed and implemented.First, an integer linear programming formulation is derived for findingexact solutions. Second, a local-search heuristic for hypergraphpartitioning is extended to cope with path-inequality constraints.Experimental results on a set of layer-assignment benchmarks demonstratedthat the path-constrained local-search heuristic achieves optimum ornear-optimum solutions with several orders of magnitude faster than theinteger linear programming approach.