研究生: |
張閔盛 Chang, Min-Sheng |
---|---|
論文名稱: |
以矽載板為中介層的三維晶片佈局規劃及訊號分配 Floorplanning and Signal Assignment for Silicon Interposer-based 3D ICs |
指導教授: |
王廷基
Wang, Ting-Chi |
口試委員: |
李毅郎
Li, Yih-Lang 陳宏明 Chen, Hung-Ming |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 資訊工程學系 Computer Science |
論文出版年: | 2013 |
畢業學年度: | 102 |
語文別: | 英文 |
論文頁數: | 36 |
中文關鍵詞: | 中介層 、訊號分配 、佈局規劃 、三維晶片 |
外文關鍵詞: | 2.5D ICs, Signal Assignment, Floorplanning |
相關次數: | 點閱:2 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
所謂的三維晶片(3D ICs)是將傳統二維晶片以垂直的方式堆疊起來所形成的。三維晶片是目前晶片發展的趨勢,但三維晶片的設計上面臨了許多問題,而製程上也比傳統二維晶片來得困難很多。因此,發展出了一種以矽載板為中介層的三維晶片(Interposer-based 3D ICs或稱為2.5D ICs)。這種2.5D ICs是將傳統二維晶片以水平的方式擺放在一個矽載板(interposer)上,晶片和晶片間的訊號全藉由矽載板來傳遞。
在2.5D ICs的設計中,晶片的佈局規劃以及訊號分配是非常重要的,因為不好的晶片佈局規劃以及不好的訊號分配,會影響晶片繞線的長度,甚至會產生過長的繞線,而這些過長的繞線,會讓晶片的效能變差。而這篇論文就是來討論以及解決2.5D ICs的晶片佈局規劃同時考慮訊號分配的問題。
在這篇論文中,我們提出了一個窮舉式的佈局規劃演算法(EFA)來解決2.5D ICs的晶片佈局規劃同時將訊號分配考慮進來。我們也提出了一個演算法(MCMF)來解決2.5D ICs的訊號分配問題。為了加速這兩的演算法(EFA和MCMF),我們提出了一些加速的技巧,來讓我們的演算法更有效率。
由實驗結果看來,我們的演算法在加上一些加速的技巧,能夠有效率的解決2.5D ICs的晶片佈局規劃以及訊號的分配。
Since the implementation of 3D ICs is problematic, interposer-based 3D ICs (or known as 2.5D ICs), using a silicon interposer as an interface between a package and dies, has been seen as an alternative approach to 3D ICs. In a 2.5D IC, the floorplan of dies on the interposer and the signal assignment of macro-bumps and TSVs would impact the routing wirelength. Because overlong routing wirelength would degrade the performance of 2.5D ICs and cause timing violations, the die floorplanning and signal assignment problems for 2.5D ICs are critical. In this thesis, we propose an enumeration-based floorplanning algorithm (EFA) to solve the signal-aware die floorplanning problem (SDFP), and we solve a signal assignment problem (SAP) for micro-bumps and TSVs by a min-cost max-flow (MCMF) algorithm. To speed up the EFA and the min-cost max-flow algorithm, we also present several acceleration techniques. The experimental results show that the proposed floorplanning and signal assignment algorithms are effective and the speedup is significant when the proposed acceleration techniques are used.
[1] P. Dorsey, “Xilinx Stacked Silicon Interconnect Technology Delivers Breakthrough FPGA Capacity, Bandwidth, and power Efficiency”, Xilinx White Paper: Virtex-7 FPGAs, 2010.
[2] Y.-K. Ho and Y.-W. Chang, “Multiple chip planning for chip-interposer codesign”, in Proc. of DAC, 2013, pp. 1-6.
[3] H.-C. Lee and Y.-W. Chang, "A chip-package-board co-design methodology," in Proc. of DAC, 2012, pp. 1082-1087.
[4] D. H. Kim, K. Athikulwongse, and S. K. Lim, "A study of Through-Silicon-Via impact on the 3D stacked IC layout," in Proc. of ICCAD, 2009, pp. 674-680.
[5] J. Cong, G. Luo, J. Wei and Y. Zhang , “Thermal-aware 3D IC placement via transformation”, ASP-DAC, 2007, pp.780-785.
[6] T.-C. Wang and D. F. Wong, “Optimal Floorplan Area Optimizatioin,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 11, No. 8, August 1992, pp. 992-1002.
[7] T.-C. Wang and D. F. Wong, “Graph-Based Techniques to Speed up Floorplan Area Optimization,” INTEGRATION, the VLSI Journal, Vol. 15, No. 2, October 1993, pp. 179-199.
[8] T.-C. Wang and D. F. Wong, “A Note on the Complexity of Stockmeyer’s Floorplan Area Optimization,” Algorithmic Aspects of VLSI Layout (edited by M. Sarrafzadeh and D. T. Lee), World Scientific Publishing Co. Pte. Ltd., 1993, pp. 309-320.
[9] D. J.-H. Huang and A. B. Kahng, “Partitioning-based standard-cell global placement with an exact objective”, ISPD, 1997, pp. 18-25.
[10] Hayward H. Chan , Saurabh N. Adya , Igor L. Markov , “Are Floorplan Representations Important In Digital Design?”, ISPD 2005, pp. 129-136.
[11] L. Madden, “Heterogeneous 3-D stacking, can we have the best of both (technology) worlds”, Xilinx, 2013
[12] Saurabh N. Adya , and Igor L. Markov , “Fixed-outline Floorplanning :Enabling Hierarchical Design”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 11, Issue 6, Dec. 2003, pp. 1120-1135.
[13] H. Murata, K. FUjiyoshi, S. Makatake, and Y. Kajatani, “Rectangle packing based module placement”, in Proc. ICCAD, 1995, pp. 482-479.
[14] X. Tang, and D. F. Wong, “FAST-SP: A Fast Algorithm for Block Placement based on Sequence Pair”, ASP-DAC, 2001, pp. 521-526.
[15] H. Murata, and E. S. Kuh, “Sequence-pair based placement method for hard/soft/pre-placed modules”, ISPD , 1998, pp. 167-172 .
[16] Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu, “B*-Trees: a new representation for non-slicing floorplans”, DAC, 2000, pp. 458-463.
[17] P.-N. Guo, C.-K. Cheng, and T. Yoshimura, “An O-tree representation of non-slicing floorplan and its applications” , DAC , 1999, pp. 268-273.
[18] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by Simulated Annealing”, Science, 220(4589),1983, pp.8-13.
[19] D. F. Wong , and C. L. Liu, “A new algorithm for floorplan design”, DAC, 1989, pp. 101-107.
[20] LEDA: http://www.algorithmic-solutions.info/leda_manual/manual.html
[21] Intel's Packaging Databook Chapter 15: The Chip Scale Package