Timing-driven via placement heuristics for three-dimensional ICs

被引:8
|
作者
Pavlidis, Vasilis F. [1 ]
Friedman, Eby G. [1 ]
机构
[1] Univ Rochester, Dept Elect & Comp Engn, Rochester, NY 14627 USA
基金
美国国家科学基金会;
关键词
three-dimensional integration; 3-D ICs; timing optimization; TSV placement; interplane interconnects; through-silicon-vias;
D O I
10.1016/j.vlsi.2007.11.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The dependence of the interconnect delay on the interplane via location in three-dimensional (3-D) ICs is investigated in this paper. The delay of these interconnects can be significantly decreased by optimally placing the interplane vias. The via locations that minimize the propagation delay of two-terminal interconnects consisting of multiple interplane vias under the distributed Elmore delay model are determined. For interconnect trees, the interplane via locations that minimize the summation of the weighted delay of the sinks of the tree are also determined. For these interconnect structures, the interplane via locations are obtained both through geometric programming and near-optimal heuristics. Placement constraints are imposed such that the path is negligibly affected. The proposed heuristics are used to implement efficient algorithms that exhibit lower computational times as compared to general optimization solvers with negligible loss of optimality. Various interplane via placement scenarios are considered. Simulation results indicate delay improvements for relatively short point-to-point interconnects of up to 32% with optimally placed interplane vias. For interconnect trees, the maximum improvement in delay for optimally placed interplane vias is 19%. The proposed algorithms can be integrated into a design flow for 3-D circuits to enhance placement and routing where timing is a primary design criterion. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:489 / 508
页数:20
相关论文
共 50 条
  • [21] A novel net weighting algorithm for timing-driven placement
    Kong, T
    IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 172 - 176
  • [22] A timing-driven macro-cell placement algorithm
    Mo, F
    Tabbara, A
    Brayton, RK
    2001 INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD 2001, PROCEEDINGS, 2001, : 322 - 327
  • [23] Enhancing timing-driven FPGA placement for pipelined netlists
    Eguro, Ken
    Hauck, Scott
    2008 45TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2008, : 34 - 37
  • [24] An analytic placer for mixed-size placement and timing-driven placement
    Kahng, AB
    Wang, Q
    ICCAD-2004: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2004, : 565 - 572
  • [25] Effective heuristics for timing driven constructive placement
    Raj, RV
    Murty, NS
    Rao, PSN
    Patnaik, LM
    TENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 1997, : 38 - 43
  • [26] A Novel Net Weighting Algorithm for Power and Timing-Driven Placement
    Chentouf, Mohamed
    Ismaili, Zine El Abidine Alaoui
    VLSI DESIGN, 2018,
  • [27] Clock-Tree-Aware Incremental Timing-Driven Placement
    Livramento, Vinicius
    Netto, Renan
    Guth, Chrystian
    Guntzel, Jose Luis
    Dos Santos, Luiz C. V.
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2016, 21 (03)
  • [28] Timing-driven placement for heterogeneous field programmable gate array
    Hu, Bo
    IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, ICCAD, 2006, : 551 - 556
  • [29] A path-based timing-driven quadratic placement algorith
    Hou, WT
    Hong, XL
    Wu, WM
    Cai, YC
    ASP-DAC 2003: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, 2003, : 745 - 748
  • [30] Timing-Driven and Placement-Aware Multibit Register Composition
    Seitanidis, Ioannis
    Dimitrakopoulos, Giorgos
    Mattheakis, Pavlos M.
    Masse-Navette, Laurent
    Chinnery, David
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2019, 38 (08) : 1501 - 1514