Jiang Hu
Gustavo Tellez
ABSTRACT
Interconnect optimization, including buffer insertion and Steiner tree construction, continues to be a pillar technology that largely determines overall chip performance. Buffer insertion algorithms in published literature are mostly focused on optimizing only the most critical path. This is a sensible approach for the first order effect. As people strive to squeeze out more performance in the post Moore's law era, the timing of near critical paths is worth considering as well. In this work, a p-norm based Figure Of Merit (pFOM) is proposed to account for both the critical and near critical path timing. Accordingly, a pFOM-driven buffer insertion method is developed. Further, the interaction with timing driven Steiner tree is investigated. The proposed techniques are validated in an industrial design flow and the results confirm their advantages.
- C. J. Alpert, G. Gandham, M. Hrkic, J. Hu, A. B. Kahng, J. Lillis, B. Liu, S. T. Quay, S. S. Sapatnekar, and A. J. Sullivan. 2002. Buffered Steiner trees for difficult instances. IEEE Transactions on Computer-Aided Design Vol. 21, 1 (Jan. 2002), 3--14.Google Scholar
- C. J. Alpert, J. Hu, S. S. Sapatnekar, and C. N. Sze. 2006. Accurate estimation of global buffer delay within a floorplan. IEEE Transactions on Computer-Aided Design Vol. 25, 6 (June. 2006), 1140--1145. Google ScholarDigital Library
- C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, and D. Karger. 1995. Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. IEEE Transactions on Computer-Aided Design Vol. 14, 7 (July. 1995), 890--896. Google ScholarDigital Library
- C. Bartoschek, S. Held, D. Rautenbach, and J. Vygen. 2006. Efficient generation of short and fast repeater tree topologies Proceedings of the ACM International Symposium on Physical Design. 20--27. Google ScholarDigital Library
- K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins. 1995. Near-optimal critical sink routing tree constructions. IEEE Transactions on Computer-Aided Design Vol. 14, 12 (Dec.. 1995), 1417--36. Google ScholarDigital Library
- C. P. Chen, H. Zhou, and D. F. Wong. 1996. Optimal non-uniform wire-sizing under the Elmore delay model Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 38--43. Google ScholarDigital Library
- J. Cong and K.-S. Leung. 1995. Optimal wiresizing under the distributed Elmore delay model. IEEE Transactions on Computer-Aided Design Vol. 14, 3 (March. 1995), 321--336. Google ScholarDigital Library
- H. Hou, J. Hu, and S. S. Sapatnekar. 1999. Non-Hanan routing. IEEE Transactions on Computer-Aided Design Vol. 18, 4 (April. 1999), 436--444. Google ScholarDigital Library
- M. Hrkic and J. Lillis. 2002. S-Tree: A technique for buffered routing tree synthesis Proceedings of the ACM/IEEE Design Automation Conference. 578--583. Google ScholarDigital Library
- M. Hrkic and J. Lillis. 2003. Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost, congestion and blockages. IEEE Transactions on Computer-Aided Design Vol. 22, 4 (April. 2003), 481--491. Google ScholarDigital Library
- J. Lillis, C. K. Cheng, T. T. Lin, and C. Y. Ho. 1996 c. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing. In Proceedings of the ACM/IEEE Design Automation Conference. 395--400. Google ScholarDigital Library
- J. Lillis, C. K. Cheng, and T. Y. Lin. 1996 a. Optimal wire sizing and buffer insertion for low power and a generalized delay model. IEEE Journal of Solid-State Circuits Vol. 31, 3 (March. 1996), 437--447.Google ScholarCross Ref
- J. Lillis, C. K. Cheng, and T. Y. Lin. 1996 b. Simultaneous routing and buffer insertion for high performance interconnect Proceedings of the Great Lake Symposium on VLSI. 148--153. Google ScholarDigital Library
- T. Okamoto and J. Cong. 1996. Interconnect layout optimization by simultaneous Steiner tree construction and buffer insertion. In ACM Physical Design Workshop. 1--6.Google Scholar
- P. J. Osler. 2004. Placement driven synthesis case studies on two sets of two chips: hierarchical and flat. In Proceedings of the ACM International Symposium on Physical Design. 190--197. Google ScholarDigital Library
- M. Ozdal, S. Burns, and J. Hu. 2011. Gate sizing and device technology selection algorithms for high-performance industrial designs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 724--731. Google ScholarDigital Library
- Y. Peng and X. Liu. 2005. Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method. In Proceedings of the ACM/IEEE Design Automation Conference. 813--818. Google ScholarDigital Library
- W. Shi and Z. Li. 2005. A fast algorithm for optimal buffer insertion. IEEE Transactions on Computer-Aided Design Vol. 24, 6 (June. 2005), 879--891. Google ScholarDigital Library
- L. P. P. P. van Ginneken. 1990. Buffer placement in distributed RC-tree networks for minimal Elmore delay Proceedings of the IEEE International Symposium on Circuits and Systems. 865--868.Google Scholar
Index Terms
- Interconnect Optimization Considering Multiple Critical Paths
Recommendations
Buffered Steiner tree construction with wire sizing for interconnect layout optimization
ICCAD '96: Proceedings of the 1996 IEEE/ACM international conference on Computer-aided designThis paper presents an efficient algorithm for buffered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a Steiner ...
Approximating the selected-internal Steiner tree
In this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G=(V,E) with a cost function c:E->R^+ and two subsets R and R^' satisfying R^'@?R@?V, a selected-internal Steiner tree is a Steiner tree which contains (...
Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a ...
Comments