Geometric programming for circuit optimization
Proceedings of the 2005 international symposium on Physical design
Maze routing steiner trees with effective critical sink optimization
Proceedings of the 2007 international symposium on Physical design
Digital Circuit Optimization via Geometric Programming
Operations Research
Maze routing Steiner trees with delay versus wire length tradeoff
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.03 |
A routing algorithm that generates a Steiner route for a set of sinks with near optimal Elmore delay to the critical sink is presented. The algorithm outperforms the best existing alternative for Elmore-delay-based critical sink routing. With no critical sinks present, the algorithm produces routes comparable to the best previously existing Steiner router. Since performance-oriented layout generators employ iterative techniques that require a large number of calls to the routing algorithm for layout evaluation, a fast algorithm for routing is desirable. The algorithm presented here has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques