INTEGRA: Fast Multi-Bit Flip-Flop Clustering for Clock Power Saving Based on Interval Graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
121 | en_US |
dc.citation.spage |
115 | en_US |
dc.contributor.author |
Jiang, Iris H. -R. | en_US |
dc.contributor.author |
Chang, Chih-Long | en_US |
dc.contributor.author |
Yang, Yu-Ming | en_US |
dc.contributor.author |
Tsai, Evan Y. -W. | en_US |
dc.contributor.author |
Chen, Lancer S. -F. | en_US |
dc.contributor.department |
電子工程學系及電子研究所 | zh_TW |
dc.contributor.department |
Department of Electronics Engineering and Institute of Electronics | en_US |
dc.date.accessioned |
2014-12-08T15:04:32Z | |
dc.date.available |
2014-12-08T15:04:32Z | |
dc.date.issued |
2011 | en_US |
dc.description.abstract |
Clock power is the major contributor to dynamic power for modern IC design. A conventional single-bit; flip-flop cell uses an inverter chain with a high drive strength to drive the clock signal. Clustering such cells and forming a multi-bit flip-flop can share the drive strength, dynamic power, and area of the inverter chain, even can save the clock network power and facilitate the skew control. Hence, in this paper, we focus on multi-bit flip-flop clustering at post-placement to gain these benefits. Utilizing the properties of Manhattan distance and coordinate transformation, we model the problem instance by two interval graphs and use a pair of linear-size sequences as our representation. Without enumerating all compatible combinations, we extract only partial sequences that are necessary to cluster flip-flops at a time, thus leading to an efficient clustering scheme. Moreover, our coordinate transformation brings fast; operations to execute our algorithm. Experimental results show the superior efficiency and effectiveness of our algorithm. | en_US |
dc.identifier.isbn |
978-1-4503-0711-6 | en_US |
dc.identifier.journal |
ISPD 11: PROCEEDINGS OF THE 2011 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/3018 | |
dc.identifier.wosnumber |
WOS:000290932300020 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Clock power | en_US |
dc.subject |
multi-bit flip-flops | en_US |
dc.subject |
post-placement optimization | en_US |
dc.subject |
interval graph | en_US |
dc.subject |
coordinate transformation | en_US |
dc.title |
INTEGRA: Fast Multi-Bit Flip-Flop Clustering for Clock Power Saving Based on Interval Graphs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Jiang, I. H. R., Chang, C.-L., Yang, Y.-M., Tsai, E. Y. W., & Chen, L. S. F. (2011). INTEGRA: Fast Multi-Bit Flip-Flop Clustering for Clock Power Saving Based on Interval Graphs. ISPD 11: PROCEEDINGS OF THE 2011 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, 115–121. https://ir.lib.nycu.edu.tw/handle/11536/3018
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/3018