簡易檢索 / 詳目顯示

研究生: 陳永宸
Chen, Yung-Chen
論文名稱: 透過動態分配單元擺放圍籬範圍之能感知圍籬區域限制數學解析擺置方法
A Fence Region Aware Analytical Placement Approach by Dynamic Allocating Cells to Fence Areas
指導教授: 林家民
Lin, Jai-Ming
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2023
畢業學年度: 112
語文別: 英文
論文頁數: 35
中文關鍵詞: 標準邏輯單元全局擺置演算法圍籬區域限制數學分析擺置公式多階層架構叢集實體設計
外文關鍵詞: Standard cell, Global placement algorithm, Fence region constraint, Analytical placement formulation, Multilevel framework, Cluster, Physical design
相關次數: 點閱:75下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 摘要 I Abstract II 誌謝 IV Table of Contents V List of Tables VII List of Figures VIII Chapter 1 Introduction 1 1.1 Motivation 2 1.2 Our Contribution 3 Chapter 2 Problem Formulation and preliminaries 5 2.1 Problem Formulation 5 2.2 Review of Dataflow-aware Analytical Placement Approach [10] 6 Chapter 3 Overview of Our Methodology 8 Chapter 4 Fence Region Aware Clustering 11 4.1 Clustering Under Fence Region Constraints 11 Chapter 5 Initial Global Distribution 14 5.1 Design flow of the Stage 14 5.2 Recursive Partitioning Procedure 15 5.3 QP with Zone Constraint 17 Chapter 6 Fence Region Aware Placement Refinement 18 6.1 Desirable Placement Region in Three Phase 18 6.1.1 First phase 18 6.1.2 Second phase 19 6.1.3 Third phase 19 6.2 Fence Region Aware Analytical Placement Formulation 20 Chapter 7 Acceleration of Our Program 23 7.1 Fixed Objects with Stable Locations 23 7.2 Partition of A Netlist Geometrically 24 Chapter 8 Experimental Results 26 8.1 Environment 26 8.2 Comparison with Effect of Techniques Applied in Our Methodologies 27 8.3 Comparison with The Previous Fence Region Aware Placer 29 8.4 Comparison with fence region aware wirelength model [8] 31 Chapter 9 Conclusion 33 Bibliography 34

    [1] C. Alpert, A. Kahng, G.-J. Nam, S. Reda, and P. Villarrubia, “A Semi-persistent Clustering Technique for VLSI Circuit Placement,” in Proc. of ISPD, pp. 200–207, 2005.
    [2] I. S. Bustany, D. Chinnery, J. R. Shinnerl, and V. Yutsis, “ISPD 2015 Benchmarks with Fence Regions and Routing Blockages for Detailed-routing-driven Placement,” in Proc. of ISPD, pp. 157–164, 2015.
    [3] T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang, “NTUplace3: An Analytical Placer for Large-scale Mixed-size Designs with Pre-placed Blocks and Density Constraints,” IEEE Trans. of TCAD, vol. 27, no. 7, pp. 1228–1240, 2008.
    [4] W. -K. Chow, J. Kuang, P. Tu and E. F. Y. Young, “Fence-aware Detailed-routability Driven Placement,” in Proc. of SLIP, pp. 1–7, 2017.
    [5] N. K. Darav, A. Kennings, A. F. Tabrizi, D. Westwick, and L. Behjat, “Eh?Placer: A High-Performance Modern Technology-driven Placer,” ACM TODAES, vol. 21, no. 3, Apr. 2016.
    [6] K. -R. Dai, W. -H. Liu and Y. -L. Li, “NCTU-GR: Efficient Simulated Evolution-Based Rerouting and Congestion-Relaxed Layer Assignment on 3-D Global Routing,” IEEE Trans. of TVLSI, vol. 20, no. 3, pp. 459–472, 2012.
    [7] J. Gu, Z. Jiang, Y. Lin and D. Z. Pan, “DREAMPlace 3.0: Multi-Electrostatics Based Robust VLSI Placement with Region Constraints,” in Proc. ICCAD, pp. 1–9, 2020.
    [8] C. -C. Huang et al., “NTUplace4dr: A Detailed-routing-driven Placer for Mixed-size Circuit Designs with Technology and Region Constraints,” IEEE Trans. of TCAD, vol. 37, no. 3, pp. 669–681, March. 2018.
    [9] M. R. Hestenes, and E. Stiefel, “Methods of Conjugate Gradients for Solving Linear Systems,” J. Res. Nat. Bur. Stand., vol. 49, no. 6, pp. 409-436, 1952.
    [10] J. -M. Lin, W. -F. Huang, Y. -C. Chen, Y. -T. Wang and P. -W. Wang, “DAPA: A Dataflow-aware Analytical Placement Algorithm for Modern Mixed-size Circuit Designs,” in Proc. of ICCAD, pp. 1–8, 2021.
    [11] J. -M. Lin, B. -H. Yu and L. -Y. Chang, “Regularity-aware Routability-driven Placement Prototyping Algorithm for Hierarchical Mixed-size Circuits,” in Proc. of ASPDAC, pp. 438–443, 2017.
    [12] J. -M. Lin, C. -W. Huang, L. -C. Zane, M. -C. Tsai, C. -L. Lin and C. -F. Tsai, “Routability-driven Global Placer Target on Removing Global and Local Congestion for VLSI Designs,” in Proc. ICCAD, 2021.
    [13] Min Pan, N. Viswanathan and C. Chu, “An Efficient and Effective Detailed Placement Algorithm,” in Proc. of ICCAD, pp. 48–55, 2005.
    [14] Peter Spindler, Ulf Schlichtmann, and Frank M. Johannes, “Fast Legalization of Standard Cell Circuits with Minimal Movement,” in Proc. of ISPD, pp. 47–53, 2008.

    無法下載圖示 校內:2028-11-20公開
    校外:2028-11-20公開
    電子論文尚未授權公開,紙本請查館藏目錄
    QR CODE