簡易檢索 / 詳目顯示

回結果列表
研究生： 陳家健
Chen, Jia-Jian
論文名稱： 適用於大型混合尺寸設計藉由快速標準邏輯閘擺置達成擁擠度感知之模塊擺置器
Congestion-aware Macro Placer Through A Fast Cell Placement for Large-scale Mixed-size Designs
指導教授： 林家民
Lin, Jai-Ming
學位類別： 碩士
Master
系所名稱： 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年： 2020
畢業學年度： 109
語文別： 英文
論文頁數： 28
中文關鍵詞： 實體設計 、混和尺寸設計 、模組擺置 、可繞度
外文關鍵詞： physical design, mixed-size design, macro placement, routability
相關次數： 點閱：106  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 先前的模塊擺置方法皆假設標準邏輯閘的位置與擺置原型的位置相同，然而在模塊擺置階段中，輕微的移動都會導致標準邏輯閘的位置與下一階段標準邏輯閘擺置的位置相比有顯著差異，因此先前的模塊擺置方法皆無法準確的評估繞線長度與可繞度。本篇論文提出了一個快速標準邏輯閘擺置方法，在模塊擺置階段重新擺置標準邏輯閘，並基於Lin等人 [15] 提出的角落拼接表示法的模塊擺置程序得到模塊的初始擺置位置，再進行模塊的優化。我們的模塊優化演算法中包含三個方法：擴大模塊之間的間距、重新排列模塊的擺置順序和移動模塊的方式來解決模塊產生的繞線擁擠問題。除此之外，本篇論文提出了一個矩形架構的距離公式，此距離公式可以使模塊擺置更靠近擺置區域邊界並且使模塊擺置更規則。實驗結果表示，我們的方法無論在線長或是可繞度皆優於Lin等人、CP-tree [6]、ECS [7]和Vidal-Obiols等人[17]。

    The previous macro placement approaches assume the locations of the standard cell are determined in placement prototyping. This leads to incorrect estimation about wirelength and routability in the macro placement stage, since the locations of the standard cell will significantly change when the macro is moved. This paper proposed a high-speed post-placement of cell methodology to placement of cells during the macro placement, and apply the corner stitching based macro placement proposed by Lin et al. [15] to get the initial placement, and refine the positions of macro by our macro placement optimization. The macro placement optimization includes three methods: macro expansion, determination of macro placement ordering, and macro shifting. These methods solve the routing congestion region which is caused by the moveable macros. In addition, we proposed a rectangular frame distance that can help packing macro more regularly and close to the placement boundary. The experimental results show that our methodology is better than Lin et al., CP-tree [6], ECS [7], and Vidal-Obiols et al [17]. in terms of routability and wirelength.

    誌謝 II 摘要 III Abstract IV Table of Contents V List of Algorithms VII List of Tables VIII List of Figures IX Chapter 1 Introduction 1 1.1 Previous Works 2 1.2 Our Contributions 3 1.3 Thesis Organization 4 Chapter 2 Preliminaries 5 2.1 Review of Macro Placement Algorithm 5 2.2 Review of Congestion Map 7 Chapter 3 Macro Placement Methodology 8 3.1 Overview of Our Methodology 8 3.2 A New Cost Function in Macro Legalization 9 3.3 Fast Standard Cell Placement 10 3.3.1 Cluster of Standard Cells 11 3.3.2 Partition-Based Cluster Distribution 11 3.3.3 Cell Spreading 14 3.4 Macro Placement Post-optimization 16 3.4.1 Macro Expansion 17 3.4.2 Determination of Macro Placement Ordering 18 3.4.3 Macro Shifting 19 Chapter 4 Experimental Results 20 Chapter 5 Conclusion 26 Bibliography 27

    [1]. Synopsys Inc. https://www.synopsys.com/company.html
    [2]. Himax Inc. http:www.himax.com.tw/zh/company/about-himax/
    [3]. C. Alpert, A. Kahng, G.-J. Nam, S. Reda, and P. G. Villarrubia, “A Semi-persistent Clustering Technique for VLSI Circuit Placement,” in Proc. of ISPD, pp. 200-207, 2005.
    [4]. T.-C. Chen, P.-H. Yuh, Y.-W. Chang, F.-J. Huang, and T.-Y. Liu, “MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs,” IEEE TCAD, vol. 27, no. 9, pp. 657-662, 2008.
    [5]. C. Chu and Y.-C. Wong, “FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design,” IEEE TCAD, vol. 27, no. 1, pp. 70-83, Jan 2008.
    [6]. Y.-F. Chen, C.-C. Huang, C.-H. Chiou, Y.-W. Chang, and C.-J. Wang, “Routability-driven Blockage-aware Macro Placement,” in Proc. of DAC, pp. 1-6, 2014.
    [7]. C.-H. Chiou, C.-H. Chang, S.-T. Chen, and Y.-W. Chang, “Circular-contour-based Obstacle-aware Macro Placement,” in Proc. of ASP-DAC, pp. 172-177, 2016.
    [8]. C.-H. Chang, Y.-W. Chang, T.-C. Chen, “A Novel Damped-wave Framework for Macro Placement,” in Proc. of ICCAD, pp. 504-511, 2017.
    [9]. K.-R. Dai, W.-H Liu, Y.-L Li, “NCTU-GR: Efficient Simulated Evolution-based Rerouting and Congestion-relaxed Layer Assignment on 3-D Global Routing,” IEEE TVLSI, vol.22, no.3, pp. 459-472, 2012.
    [10]. C.M. Fiduccia, and R.M. Mattheyses, “A Linear-Time Heuristic for Improving Network Partitions,” in Proc. of DAC, pp. 175-181, Jun. 1982.
    [11]. C.-C. Huang, B.-Q. Lin, H.-Y. Lee, Y.-W. Chang, K.-S. Wu, and J.-Z. Yang, “NTUplace4h: A Novel Routability-Driven Placement Algorithm for Hierarchical Mixed-Size Circuit Designs,” IEEE TCAD, vol. 33, no. 12, pp. 1914-1927, Dec. 2014.
    [12]. D. Hill, “Method and system for high speed detailed placement of cells within an integrated circuit design,” 2002.
    [13]. J.-M. Lin, Y.-W. Chang, and S.-P. Lin. “Corner Sequence–A Padmissible Floorplan Representation with A Worst Case Linear-time Packing Scheme,” IEEE TVLSI, vol. 11, no .4, pp. 679-686, 2003.
    [14]. J.-M. Lin, S.-T. Li and Y.-T. Wang, “Routability-driven Mixed-size Placement Prototyping Approach Considering Design Hierarchy and Indirect Connectivity Between Macros,” in Proc. of DAC, June 2019.
    [15]. J.-M. Lin, Y.-L. Deng, Y.-C. Yang, J.-J. Chen, and Y.-C. Chen, “A Novel Macro Placement Approach based on Simulated Evolution Algorithm,” in Proc. of ICCAD 2019.
    [16]. J.K. Ousterhout, “Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools,” IEEE TCAD, vol. 3, no. 1, pp. 87-100, 1984.
    [17]. A. Vidal-Obiols, J. Cortadella, J. Petit, M. Galceran-Oms, and F. Martorell, “RTL-Aware Dataflow-Driven Macro Placement,” in Proc. of DATE, March 2019.
    [18]. M.-C. Wu and Y.-W. Chang, “Placement with Alignment and Performance Constraints Using the B*-tree Representation,” in Proc. of ICCD, pp. 568-571, 2004.
    [19]. S. I. Ward, M.-C. Kim, N. Viswanathan, Z. Li, C. Alpert, E. E. Swartzlander Jr, and D. Z. Pan, “Keep It Straight: Teaching placement how to better handle designs with datapaths,” in Proc. of ISPD, pp. 79–86, March 2012.

    無法下載圖示 校內：2025-11-30公開
    校外：2025-11-30公開
    電子論文尚未授權公開，紙本請查館藏目錄
    QR CODE