Timing-driven Steiner trees are (practically) free

作者: Charles J Alpert , Andrew B Kahng , CN Sze , Qinke Wang , None

DOI: 10.1145/1146909.1147012

关键词:

摘要: Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimizes wirelength, an RSMT may take a "non-direct" route to sink, which give the designer unnecessarily pessimistic view of delay sink. Previous works have addressed this issue through performance-driven constructions, arborescence, critical sink based constructions. Physical synthesis flows been reticent adapt universal timing-driven constructions out fear that they too expensive (in terms resource capacitance). This paper studies several different tree order show ones superior performance. A key result is add at most 2%-4% extra capacitance, thus promising avenue today's increasingly aggressive P&R flows. We demonstrate using production flow topologies can be easily embedded into incremental subflow obtain significantly improved timing (3.6% 5.1% improvements cycle time two industry testcases) practically no cost wirelength or routability.

参考文章(18)
Neal E. Young, Balaji Raghavachari, Samir Khuller, Balancing minimum spanning trees and shortest-path trees symposium on discrete algorithms. pp. 243- 250 ,(1993)
D. M. Warme, P. Winter, M. Zachariasen, Exact Algorithms for Plane Steiner Tree Problems: A Computational Study Kluwer Academic Publishers. pp. 81- 116 ,(2000) , 10.1007/978-1-4757-3171-2_6
Gabriel Robins, Andrew B. Kahng, On optimal interconnections for VLSI ,(1994)
M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt, Bicriteria Network Design Problems international colloquium on automata languages and programming. pp. 487- 498 ,(1995) , 10.1007/3-540-60084-1_99
J. Naor, B. Schieber, Improved approximations for shallow-light spanning trees foundations of computer science. pp. 536- 541 ,(1997) , 10.1109/SFCS.1997.646142
Sailesh K Rao, P Sadayappan, Frank K Hwang, Peter W Shor, None, The rectilinear steiner arborescence problem Algorithmica. ,vol. 7, pp. 277- 288 ,(1992) , 10.1007/BF01758762
Neal Young, Balaji Raghavachari, Samir Khuller, Balancing minimum spanning and shortest path trees symposium on discrete algorithms. pp. 243- 250 ,(1993) , 10.5555/313559.313760
Manjit Borah, Robert Michael Owens, Mary Jane Irwin, A fast and simple Steiner routing heuristic Discrete Applied Mathematics. ,vol. 90, pp. 51- 67 ,(1999) , 10.1016/S0166-218X(98)00085-7
C.J. Alpert, T.C. Hu, J.H. Huang, A.B. Kahng, D. Karger, Prim-Dijkstra tradeoffs for improved performance-driven routing tree design IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 14, pp. 890- 896 ,(1995) , 10.1109/43.391737
Sven Peyer, Martin Zachariasen, David Grove Jørgensen, Delay-related secondary objectives for rectilinear Steiner minimum trees cologne twente workshop on graphs and combinatorial optimization. ,vol. 136, pp. 271- 298 ,(2004) , 10.1016/S0166-218X(03)00445-1