簡易檢索 / 詳目顯示

研究生: 郭天鈺
Kuo, Tien-Yu
論文名稱: 有效率的靜態時序分析研究
On Efficient Static Timing Analysis
指導教授: 麥偉基
Mak, Wai-Kei
口試委員: 王俊堯
Wang, Chun-Yao
王廷基
Wang, Ting-Chi
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2012
畢業學年度: 100
語文別: 英文
論文頁數: 32
中文關鍵詞: 靜態時序分析平行程式演算法電子設計自動化偽路徑
外文關鍵詞: Static Timing Analysis, Parallel programming, Algorithm, Electronic Design Automation, False path
相關次數: 點閱:3下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 由於效能一直都是電路設計上的關鍵要素,且引導時序最佳化的是時序分析的結果,故而時序分析是設計流程內最重要的步驟之一。時序分析旨在求出電路的時序情形,並且檢查是否符合時序限制的要求。現今工業界的電子設計自動化工具仍然以靜態時序分析(STA)為主流,因此,以其在設計流程內的重要性,我們需要仔細斟酌多項因素以提高其分析效率。我們在本篇論文內研究了兩個靜態時序分析內的重要議題︰真實路徑測定與時序限制驗證,並提出了一個有效率的演算法以解決真實路徑測定的問題以及分享靜態時序分析引擎的設計思路。實驗結果除了展現所提出演算法的效率之外,我們也從中發現了一些有趣的趨勢。


    Since the performance of a circuit is always a key factor to be considered, timing analysis, whose result guides timing optimization, is the most important procedure in the design flow.
    Timing analysis is the step to evaluates the timing behavior of a circuit and checks whether the design can meet timing constraints or not. Current industrial EDA tools still use Static Timing Analysis (STA) as the mainstream. Due to its importance in the design flow, we need to carefully consider various factors so as to have better efficiency. In this thesis, we study two important issues in STA: true path determination and timing constraint verification. We propose an effective algorithm for the true path determination problem and share the experiences of designing an efficient STA engine to verify that all timing constraints of a circuit are satisfied. Experimental results show the efficiency of the proposed algorithm and we also find some interesting trends in the results.

    Acknowledgement i Abstract ii 1 Introduction 1 2 True Path Determination 4 2.1 Problem Introduction and Formulation . . . . . . . . . . . . . . . . . . . . 4 2.2 True Path Determination Algorithm . . . . . . . . . . . . . . . . . . . . . 5 2.2.1 Depth-First Search Method for Solution Space Reduction . . . . . . 6 2.2.2 Stable Time Interval Method for Further Reduction . . . . . . . . . 6 2.2.3 Branch-and-Bound Algorithm to Eliminate and Validate the Re- maining Candidates . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.4 Runtime Speedup Technique . . . . . . . . . . . . . . . . . . . . . 10 3 Timing Constraint Verification 14 3.1 Problem Introduction and Formulation . . . . . . . . . . . . . . . . . . . . 14 3.1.1 Quantities and Constraints to be Analyzed . . . . . . . . . . . . . . 14 3.1.2 Interconnect Model . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.1.3 Model of Combinational Cell . . . . . . . . . . . . . . . . . . . . 16 iii 3.1.4 Model of Flip-Flop . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.2 STA Engine Design Experiences . . . . . . . . . . . . . . . . . . . . . . . 17 3.2.1 Storing the Content of a Library . . . . . . . . . . . . . . . . . . . 18 3.2.2 Storing the Information of a Netlist . . . . . . . . . . . . . . . . . 18 3.2.3 Storing the Information of Signals . . . . . . . . . . . . . . . . . . 19 4 Parallelization Issues 21 4.1 On the True Path Determination Problem . . . . . . . . . . . . . . . . . . 22 4.2 On the Timing Constraint Verification Problem . . . . . . . . . . . . . . . 23 5 Experimental Results and Discussions 25 5.1 Results about the True Path Determination . . . . . . . . . . . . . . . . . . 25 5.2 Results about the STA Engine . . . . . . . . . . . . . . . . . . . . . . . . 27 5.3 Discussions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 6 Conclusion 30 Reference 31

    [1] Shingo Takahashi, Yuki Yoshida, and Shuji Tsukiyama, “A Gaussian Mixture Model
    for Statistical Timing Analysis,” In Proceedings of Design Automation Conference, pp.
    110-115, 2009
    [2] Lerong Cheng, Jinjun Xiong, and Lei He, “Non-Gaussian statistical timing analysis us-
    ing second-order polynomial fitting,” In Proceedings of Asia and South Pacific Design
    Automation Conference, pp. 130-140, 2008
    [3] Kanupriya Gulati and Sunil P. Khatri, “Accelerating Statistical Static Timing Analysis
    Using Graphics Processing Units,” In Proceedings of Asia and South Pacific Design
    Automation Conference, pp. 260-265, 2009
    [4] Amith Singhee, Sonia Singhal, Rob A. Rutenbar, “Practical, fast Monte Carlo statisti-
    cal static timing analysis: Why and how,” In Proceedings of International Conference
    on Computer-Aided Design, pp. 190-195, 2008
    [5] Pranav Ashar and Sharad Malik, “Functional Timing Analysis Using ATPG,” Transac-
    tions on Computer-Aided Design of Integrated Circuits and Systems, 14(8):1025-1030,
    August 1995
    31
    [6] Yi-Ting Chung and Jie-Hong Roland Jiang, “Functional Timing Analysis Made Fast
    and General,” In Proceedings of Design Automation Conference, pp. 1055-1060, 2012
    [7] W. C. Elmore, “The Transient Response of Damped Linear Networks with Particular
    Regard to Wide-Band Amplifiers,” Journal of Applied Physics, 19(1):55-63, January
    1948
    [8] 2011 CAD Contest of Taiwan, http://cad contest.cs.nctu.edu.tw/cad11/index.htm
    [9] R. Peset Llopis, “Exact path sensitization in timing analysis,” In Proceedings of the
    Conference on European Design Automation, pp. 380-385, 1994
    [10] Branch-and-bound algorithm, http://en.wikipedia.org/wiki/Branch and bound
    [11] 2011 PATMOS Timing Analysis Contest, http://patmos-tac.inesc-id.pt/
    [12] MPI Documents, http://www.mpi-forum.org/docs/docs.html
    [13] Linux Tutorial: Posix Thread,
    http://www.yolinux.com/TUTORIALS/LinuxTutorialPosixThreads.html
    [14] OpenMP ocial site, http://openmp.org/wp/

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE