簡易檢索 / 詳目顯示

研究生: 曾家尉
Tseng, Chia-Wei
論文名稱: 三維晶片下基於二維分割結果的z軸方向切割的選擇
Z-cut Selection Based on 2D Partitioning in 3D-IC
指導教授: 黃婷婷
Hwang, TingTing
口試委員: 黃俊達
Huang, Juinn-Dar
麥偉基
Mak, Wai-Kei
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2011
畢業學年度: 99
語文別: 中文
論文頁數: 32
中文關鍵詞: 三維晶片z軸方向切割
外文關鍵詞: 3D-IC, z-cut
相關次數: 點閱:3下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 穿透矽通道 (Through-Silicon Via) 是一個有希望能夠減少三維晶片下繞線長度的技術。然而,穿透矽通道所佔的面積卻會對三維晶片造成負面的影響。使用太多的穿透矽通道可能會造成晶片的尺寸增加,這樣一來,反而會失去原本穿透矽通道帶來的好處。因此,在這篇論文中我們將會對考慮了穿透矽通道所佔面積影響後的繞線長度做最小化的處理。因為在三維晶片下,佈局這個步驟會影響穿透矽通道的數量,所以我們的論文在佈局這個步驟中提出了一個最小成本付出的切割演算法。最後,我們在論文中比較了許多不同的演算法,實驗結果顯示最小成本付出的切割演算法是最好的。更重要的是,它也是最快的演算法。


    Through-Silicon Via (TSV) is a promising technology to reduce the length of
    interconnect in a three dimensional integrated circuit (3D-IC). However, the
    area overhead of TSV also poses a negative impact on a 3D-IC. Using too
    many TSVs will increase the die size and cancel out the benefit brought by
    TSV. Therefore, in this paper we will minimize wire length taking into account
    the number of TSVs and their size during placement in 3D-IC. Since the
    number of TSVs is determined by placement, a minimum cost cut algorithm
    is proposed in this thesis. The experimental result shows the comparisons in
    different algorithms. The best algorithm is minimum cost cut partitioning
    placement algorithm. Most of all, the runtime is the fastest, too.

    1 Introduction 1 2 Previous Work and Motivation 4 2.1 PreviousWork . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . 12 3 Algorithm 15 3.1 Heuristic Partial Enumeration . . . . . . . . . . . . . . . . . . 15 3.2 Minimum Cost Cut Partitioning Placement Algorithm . . . . 17 4 Experiments 22 4.1 Experimental Setup . . . . . . . . . . . . . . . . . . . . . . . . 22 4.2 Experimental Result . . . . . . . . . . . . . . . . . . . . . . . 23 4.2.1 Comparison Among Three Algorithms . . . . . . . . . 23 4.2.2 Different Sizes of TSVs inMCC . . . . . . . . . . . . . 26 5 Conclusion 28

    [1] J. Baliga, “Chips go vertical,” IEEE Spectrum, 2004, pp. 43-47.
    [2] Andry, P.S. et al., “A CMOS-compatible Process for Fabricating Electrical
    Throughvias in Silicon,” Proceedings of the 56th Electronic Components
    and Technology Conference, 2006, pp. 831-837
    [3] S. Spiesshoefer, Z. Rahman, G. Vangara, S. Polamreddy, S. Burkett, and
    L. Schaper, “Process Integration for Through-Silicon Vias,” Journal of
    Vacuum Science and Technology A, vol 23, issue 4, 2005, pp. 824-829.
    [4] K. Takahashi and M. Sekiguchi, “Through Silicon Via and 3-D
    Wafer/Chip Stacking Technology,” Symposium on VLSI Circuits Digest
    of Technical Papers, 2006.
    [5] I. Loi, S. Mitra, T. H. Lee, S. Fujita, and L. Benini, “A Low-Overhead
    Fault Tolerance Scheme for TSV-Based 3D Network on Chip Links,”
    International Conference on Computer-Aided Design, 2008, pp.598-602.
    [6] J. Cong, W. Jie, and Y. Zhang, “A Thermal-Driven Floorplan for
    3D-ICs,” International Conference on Computer Aided Design, 2004,
    pp.306-313.
    [7] Z. Li, X. L. Hong, Q. Zhou, S. Zeng, H. Yang, V. Pitchumani, and C-K.
    Cheng, “Integrating Dynamic Thermal Via Planning with 3D Floorplanning
    Algorithm,” International Symposium on Physical Design, 2006,
    pp.178-185.
    [8] P. Q. Zhou, Y. C. Ma, Z. Y. Li, R.P. Dick, S. Li, H. Zhou, X. L. Hong,
    and Q. Zhou, “3D-STAF: Scalable Temperature and Leakage Aware
    Floorplanning for Three-Dimensional Integrated Circuits,” International
    Conference on Computer- Aided Design, 2007, pp.590-597.
    [9] J. A. Davis, V. K. De, and J. D. Meindl, “A Stochastic Wire-Length
    Distribution for Gigascale Integration (GSI)-Part I: Derivation and Validation,”
    IEEE Transcation on Electron Devices, vol. 45, no. 3, 1998,
    pp. 580-589.
    [10] J. W. Joyner, P. Zarkesh-Ha, J. A. Davis, and J. D. Meindl, “A Three-
    Dimensional Stochastic Wire-Length Distribution for Variable Separation
    of Strata,” Proceeding of Interconnect Technology Conference,
    2000.
    [11] R. Zhang, K. Roy, C.-K. Koh, and D. B. Janes, “StochasticWire-Length
    and Delay Distributions of 3-Dimensional Circuits,” Proceeding of International
    Conference on Computer-Aided Design, 2000.
    [12] J. Cong, G. J. Luo, J.Wei, and Y. Zhang, “Thermal-Aware 3D IC Placement
    Via Transformation,” Asia and South Pacific Design Automation
    Conference, 2007, pp.780-785.
    [13] B. Goplen, and S. Sapatnekar, “Placement of 3D ICs with Thermal and
    Interlayer Via Considerations,” Design Automation Conference, 2007,
    pp. 626-631.
    [14] D. H. Kim, K. Athikulwongse, and S. K. Lim, “A Study of Through-
    Silicon-Via Impact on the 3D Stacked IC Layout,” International Conference
    on Computer Aided Design, 2009, pp 674-680.
    [15] M. Pathak, Y. J. Lee, T. Moon, and S. K. Lim, “Through-Silicon-
    Via Management during 3D Physical Design: When to Add and How
    Many?,” Proc. of The International Conference on Computer-Aided Design
    (ICCAD), 2010, pp. 387-394.
    [16] P. Garrou, C. Bower, and P. Ramm, “Handbook of 3D Integration:
    Technology an Applications of 3D Integrated Circuits,” John Wiley,
    New York, 2008.
    [17] M. C. Tsai and T. T. Hwang, “A Study on the Trade-off among Wirelength,
    Number of TSV and Placement with Different Size of TSV,”
    Proc. of VLSI Design, Automation and Test (VLSI-DAT), 2011.
    [18] T. Chan, J. Cong, and K. Sze, “Multilevel Generalized Force-Directed
    Method for Circuit Placement,” Proc. Int. Symposium on Physical Design,
    San Francisco, CA, April, 2005.
    [19] J. Cong and M. Xie, “A robust detailed placement for mixed-size IC
    designs,” Proc. Asia South Pacific Design Automation Conference, pp.
    188-194, 2006.
    [20] M. A. Breuer, “A class of min-cut placement algorithms.” In Proc. Design
    Automation Conf, pages 284-290, 1997
    [21] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford
    Stein,“Introduction to Algorithms, Third Edition.”, Chapter 12
    [22] http://glaros.dtc.umn.edu/gkhome/metis/hmetis/download
    [23] http://er.cs.ucla.edu/benchmarks/ibm-place/
    [24] http://er.cs.ucla.edu/benchmarks/ibm-place2/

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE