請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33310
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 張耀文(Yao-Wen Chang) | |
dc.contributor.author | Yen-Pin Chen | en |
dc.contributor.author | 陳彥賓 | zh_TW |
dc.date.accessioned | 2021-06-13T04:34:00Z | - |
dc.date.available | 2006-07-20 | |
dc.date.copyright | 2006-07-20 | |
dc.date.issued | 2006 | |
dc.date.submitted | 2006-07-19 | |
dc.identifier.citation | [1] C. J. Alpert, J. Hu, S. S. Sapatnekar, and C. N. Sze, Accurate Estimation
of Global Bu®er Delay within a Floorplan,' in Proceeding of International Conference on Computer Aided Design, pp. 1140-1146, 2004. [2] S.-C. Chang, C.-T. Hsieh, and K.-C. Wu, Re-synthesis for Delay Varia- tion Tolerance,' in Proceeding of Design Automation Conference, pp. 814-819, 2004. [3] K. Chaudhary and M. Pedram, A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints,' in Proceeding of Design Automation Conference, pp. 492-498, 1992. [4] J. Cong and Y. Ding, An Optimal Technology Mapping Algorithm for De- lay Optimization in Lookup-table Based FPGA Designs,' in Proceeding of International Conference on Computer Aided Design, pp. 48-53, 1992. [5] Faraday Technology Corporation, http://www.faraday-tech.com/index.html. [6] L. P. P P. van Ginneken. Bu®er Placement in Distributed RC-tree Networks for Minimal Elmore Delay,' in Proceeding of International Symposium on Cir- cuits and Systems, pp. 865-868, 1990. [7] Z. Li, W. Shi, An O(mn) Time Algorithm for Optimal Bu®er Insertion of Nets With m Sinks,' in Proceeding of Asia and South Paci‾c Design Automation Conference, pp. 320-325, 2006. [8] D.-J. Jongeneel, Y. Watanbe, R. K. Brayton, and R. Otten, Area and Search Space Control for Technology Mapping,' in Proceeding of Design Automation Conference, pp. 86-91, 2000. [9] K.Keutzer, DAGON: Technology Binding and Local Optimization by DAG Matching,' in Proceeding of Design Automation Conference, pp. 617-623, 1987. [10] Y. Kukimoto, R. K. Brayton, and P. Sawkar, Delay-optimal Technology Map- ping by DAG Covering,' in Proceeding of Design Automation Conference, pp. 348-351, 1998. [11] T. Kutzschebauch and L. Stok, Congestion Aware Layout Driven Logic Syn- thesis,' in Proceeding of International Conference on Computer Aided Design, pp. 216-223, 2001. [12] T. Kutzschebauch and L. Stok, Layout Driven Decomposition with Conges- tion Consideration,' in Proceeding of Design Automation and Test in Europe, pp.672-676, 2002. [13] E. Lehman, Y. Watanabe, J. Grodstein, and H. Harkness, Logic Decomposi- tion during Technology Mapping,' In Proceeding of International Conference on Computer Aided Design, pp. 264-271, 1995. [14] I.-M. Liu, A. Aziz, D.F. Wong, and H. Zhou, An E±cient Bu®er Insertion Al- gorithm for Large Networks Based on Lagrangian Relaxation,' In Proceeding of International Conference on Computer Design, pp. 614-621, 1999. [15] I.-M. Liu, A. Aziz, and D.F. Wong, Meeting Delay Constraints in DSM by Minimal Repeater Insertion,' In Proceeding of Design Automation and Test in Europe, pp. 436-440, 2000. [16] Q. Liu and M. Marek-Sadowska, Pre-layout Wire Length and Congestion Estimation,' In Proceeding of Design Automation Conference, pp. 582-587, 2004. [17] Q. Liu and M. Marek-Sadowska, Technology Mapping: Wire Length Prediction-based Technology Mapping and Fanout Optimization,' in Proceed- ing of International Symposium on Physical Design, pp. 145-151, 2005. [18] J. Lou, W. Chen, and M. Pedram, Concurrent Logic Restructuring and Place- ment for Timing Closure', in Proceeding of International Conference on Com- puter Aided Design, pp. 31-36, 1999. [19] A. Lu, G. Stenz, and F. M. Johannes, Technology Mapping for Minimizing Gate and Routing Area,' in Proceeding of Design Automation and Test in Europe, pp. 664-669, 1998. [20] Y. Matsunaga, On Accelerating Pattern Matching for Technology Mapping,' in Proceeding of International Conference on Computer Aided Design, pp. 118- 122, 1998. [21] A. Mishchenko, X. Wang, and T. Kam, A New Enhanced Constructive De- composition and Mapping Algorithm,' in Proceeding of Design Automation Conference, pp. 143-148, 2003. [22] M. Murofushi, T. Ishioka, M. Murakata and T. Mitsuhashi, Layout Driven Re-synthesis for Low Power Consumption LSIs', in Proceeding of Design Au- tomation Conference, pp. 666-669, 1997. [23] MVSIS: Logic Synthesis and Veri‾cation, http://embedded.eecs.berkeley.edu/Respep/Research/mvsis. [24] D. Pandini, L. T. Pileggi, and A. J. Strojwas, Understanding and Addressing the Impact of Wiring Congestion during Technology Mapping,' in Proceeding of International Symposium on Physical Design, pp. 131-136, 2002. [25] D. Pandini, L. Pileggi, and A. Strojwas, Congestion-aware Logic Synthesis,' in Proceeding of Design Automation and Test in Europe, pp. 664-671, 2002. [26] M. Pedram and N. Bhat, Layout Driven Technology Mapping,' in Proceeding of Design Automation Conference, pp. 99-105, 1991. [27] R. S. Shelar, P. Saxena, X. Wang, and S. S. Sapatnekar, Technology Map- ping: An E±cient Technology Mapping Algorithm Targeting Routing Con- gestion under Delay Constraints,' in Proceeding of International Symposium on Physical Design, pp. 137-144, 2005. [28] W. Shi and Z. Li, An O(nlogn) Time Algorithm for Optimal Bu®er Insertion,' in Proceeding of Design Automation Conference, pp. 580-585, 2003. [29] C. N. Sze, C. J. Alpert, J. Hu, and W. Shi, Path Based Bu®er Insertion,' in Proceeding of Design Automation Conference, pp. 509-514, 2005. [30] M. Zhao and S. S. Sapatnekar, A New Structural Pattern Matching Algo- rithm for Technology Mapping,' in Proceeding of Design Automation Confer- ence, pp. 371-376, 2001. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33310 | - |
dc.description.abstract | 利用預留元件做重新繞線是一種在擺置階段後改變晶片功能或是修正晶片瑕疵的技巧。這個技巧過去一向由工程師手動執行,但是目前卻變的相當困難而不能再靠人力來完成。在這篇論文中,我們提出了一個兩階段的使用預留元件修正晶片瑕疵的演算法。在第一個階段中,我們對違反時脈限制的路徑插入緩衝器,或者是改變這些路徑上邏輯閘的大小來達到符合時脈限制的目的。在第二個階段中,我們更進一步使用技術映射的技巧將違反時脈限制區域的線路重新映射。我們的演算法對五個工業界的測試檔案可以修正99.86%的違反時序總計值(total negative slack),而且我們的演算法的執行時間也相當優異,表示我們的方法是相當有效的。 | zh_TW |
dc.description.abstract | Spare cells rewiring is a technique used to fix defects or
deficiencies after the placement stage. It is traditionally done by manual work but becomes extremely hard nowadays. In this thesis, we propose the first spare cells selection algorithm consisting of two phases to optimize timing of the circuit by rewiring spare cells. In the first phase, we apply gate sizing and buffer insertion to all timing violated paths to fix timing violations. In the second phase, we further fix timing violations by extracting timing critical parts and apply technology remapping to them. Experimental results based on five industrial benchmarks show that our algorithm can fix up to 99.82\% of the total negative slack, and the runtime is very short. The experimental results show that our algorithm is efficient and effective. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T04:34:00Z (GMT). No. of bitstreams: 1 ntu-95-R93921044-1.pdf: 793794 bytes, checksum: f7a2838d5e267eec340f86346c0812b7 (MD5) Previous issue date: 2006 | en |
dc.description.tableofcontents | Abstract (Chinese) i
Abstract ii Acknowledgements iii List of Tables vi List of Figures vii Chapter 1. Introduction 1 1.1 Spare Cells for Timing Optimization . . . . . . . . . . . . . . . . . . . . 1 1.2 Previous Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2.1 Buffer Insertion and Gate Sizing . . . . . . . . . . . . . . . . . . . 4 1.2.2 Physical and Logic Co-Synthesis . . . . . . . . . . . . . . . . . . . 7 1.3 Our Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.4 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Chapter 2. Preliminaries 11 2.1 The Timing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2 Dynamic Programming Framework . . . . . . . . . . . . . . . . . . . . . 13 2.3 Path-based Buffer Insertion . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.4 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Chapter 3. The Spare Cells Selection Algorithm 23 3.1 Algorithm Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.2 Gate Sizing and Buffer Insertion . . . . . . . . . . . . . . . . . . . . . . . 24 3.2.1 Delay Cost Calculation . . . . . . . . . . . . . . . . . . . . . . . . 24 3.2.2 Sizing and Bu®ering Operations . . . . . . . . . . . . . . . . . . . 28 3.2.3 Bounding Box for Choosing Spare Cells . . . . . . . . . . . . . . . 31 3.2.4 Solution Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 3.3 Technology Remapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 3.3.1 Ideal locations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 3.3.2 Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.4 Time Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . 40 3.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 Chapter 4. Experimental Results 43 Chapter 5. Conclusion and Future Work 53 Bibliography 54 | |
dc.language.iso | en | |
dc.title | 利用預留元件及技術重新映射做工程修改命令的時序最佳化 | zh_TW |
dc.title | ECO Timing Optimization Using Spare Cells
and Technology Remapping | en |
dc.type | Thesis | |
dc.date.schoolyear | 94-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 林永隆(Youn-Long Lin),王廷基(Ting-Chi Wang),陳宏明(Hung-Ming Chen) | |
dc.subject.keyword | 預留元件,技術映射, | zh_TW |
dc.subject.keyword | spare cell,technology mapping,buffer insertion, | en |
dc.relation.page | 57 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2006-07-20 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 775.19 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。