Yilin Zhang
ABSTRACT
In this paper, we study a fundamental and crucial problem of building timing-driven over-the-block rectilinear Steiner tree (TOB-RST) with pre-buffering and slew constraints. We pre-characterize the tree topology and buffer distribution to provide accurate timing information for our final RST construction. In most previous work, the routing resources over the IP blocks were simply treated as routing blockages. Our TOB-RST could reclaim the ``wasted'' over-the-block routing resources while meeting user-specified timing (slack and slew) constraints. Before fixing topology, a topology-tuning is performed based on location of buffers to improve timing without increasing buffering cost. Experiments demonstrate that TOB-RST can significantly improve the worst negative slack (WNS) with even less buffering and wirelength compared with other slack-driven obstacle-avoiding rectilinear Steiner tree (SD-OARST) algorithms.
- 2012 Overall Roadmap Technology Characteristics (ORTC) Tables. http://www.itrs.net/Links/2012ITRS/Home2012.htm.Google Scholar
- G. Ajwani, C. Chu, and W. Mak. FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction. In Proc. ISPD, pages 194--204, 2010. Google ScholarDigital Library
- C. J. Alpert, M. Hrkic, J. Hu, A. B. Kahng, J. Lillis, B. Liu, S. T. Quay, S. S. Sapatnekar, A. J. Sullivan, and P. Villarrubia. Buffered Steiner Trees for Difficult Instances. In Proc. ISPD, pages 4--9, 2001. Google ScholarDigital Library
- H. B. Bakoglu. Circuits, interconnections, and packaging for VLSI. Addison-Wesley, 1990.Google Scholar
- M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE TCAD, 13(12):1563--1568, 1994. Google ScholarDigital Library
- Chung-Kuan Cheng, Ting-Ting Y. Lin, and Ching-Yen Ho. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing. In Proc. DAC, pages 395--400, 1996. Google ScholarDigital Library
- C. Chu and Y. Wong. FLUTE: Fast Loopup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design. IEEE TCAD, 27(1):70--83, 2008. Google ScholarDigital Library
- J. Cong, L. He, K. Khoo, C. K., and D. Z. Pan. Interconnect Design for Deep Submicron ICs. In Proc. ICCAD, pages 478--485, 1997. Google ScholarDigital Library
- J. Cong, K. Leung, and D. Zhou. Performance-Driven Interconnect Design Based on Distributed RC Delay Model. In Proc. DAC, pages 606--611, 1993. Google ScholarDigital Library
- J. Griffith, G. Robins, J. S. Salowe, and T. Zhang. Closing the gap: Near-optimal Steiner trees in polynomial time. IEEE TCAD, 13(11):1351--1365, 1994. Google ScholarDigital Library
- S. Hu, C.J. Alpert, J. Hu, S.K. Karandikar, Z. Li, W. Shi, and C.N. Sze. Fast algorithms for slew-constrained minimum cost buffering. IEEE TCAD, 26(11):2009--2022, 2007. Google ScholarDigital Library
- T. Huang and E. F. Young. An Exact Algorithm for the construction of Rectilinear Steiner Minimum Trees among Complex Obstacles. In Proc. DAC, pages 164--169, 2011. Google ScholarDigital Library
- T. Huang and E. F.Y. Young. Construction of rectilinear Steiner minimum trees with slew constraints over obstacles. In Proc. ICCAD, pages 144--151, 2012. Google ScholarDigital Library
- k. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins. Rectilinear Steiner Trees with Minimum Elmore Delay. In Proc. DAC, pages 381--386, 1994. Google ScholarDigital Library
- A. B. Kahng and B. Liu. Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization. In Proc. IEEE Annual Symp. on VLSI, pages 183--188, 2003. Google ScholarDigital Library
- C. V. Kashyap, C. J. Alpert, F. Liu, and A. Devgan. Closed Form Expressions for Extending Step Delay and Slew Metrics to Ramp Inputs. In Proc. ISPD, pages 24--31, 2003. Google ScholarDigital Library
- L. Li, Z. Qian, and E. F. Young. Generation of Optimal Obstacle-avoiding Rectilinear Steiner Minimum Tree. In Proc. ICCAD, pages 21--25, 2009. Google ScholarDigital Library
- L. Li and E. F. Young. Obstacle-avoiding Rectilinear Steiner Tree Construction. In Proc. ICCAD, pages 523--528, 2008. Google ScholarDigital Library
- Y. Lin, S. Chang, and Y. Li. Critical-trunk-based obstacle-avoiding rectilinear Steiner tree routings and buffer insertion for delay and slack optimization. IEEE TCAD, 30(9):1335--1348, 2011. Google ScholarDigital Library
- Ion I. Mandoiu, Vijay V. Vazirani, and Joseph L. Ganley. A new heuristic for rectilinear Steiner trees. IEEE TCAD, 19(10):1129--1139, 2000. Google ScholarDigital Library
- T. Okamoto and J. Cong. Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion. In Proc. Asia and South Pacific Design Automation Conf., pages 44--49, 1996.Google Scholar
- P. J. Osler. placement driven synthesis case studies on two sets of two chips: hierarchical and flat. In Proc. ISPD, pages 190--197, 2004. Google ScholarDigital Library
- M. Pan, C. Chu, and P. Patra. A Novel Performance-Driven Topology Design Algorithm. In Proc. Asia and South Pacific Design Automation Conf., pages 244--249, 2007. Google ScholarDigital Library
- D. M. Warme, P. Winter, and M. Zachariasen. Exact algorithms for plane steiner tree problems: a computational study, 2000.Google Scholar
- Y. Zhang, A. Chakraborty, S. Chowdhury, and D. Z. Pan. Reclaiming Over-the-IP-Block Routing Resources With Buffering-Aware Rectilinear Steiner Minimum Tree Construction. In Proc. ICCAD, pages 137--143, 2012. Google ScholarDigital Library
Index Terms
- Timing-driven, over-the-block rectilinear steiner tree construction with pre-buffering and slew constraints
Recommendations
Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction
It is well known that the problem of constructing a timing-driven rectilinear Steiner tree for any signal net is important in performance-driven designs and has been extensively studied. Until now, many efficient approaches have been proposed for the ...
Obstacle-avoiding rectilinear Steiner tree construction
ICCAD '08: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided DesignIn today's VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. This problem has attracted a ...
Efficient obstacle-avoiding rectilinear steiner tree construction
ISPD '07: Proceedings of the 2007 international symposium on Physical designGiven a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (called Steiner points), and avoids running through any obstacle to ...
Comments