Whitespace-Aware TSV Arrangement in 3-D Clock Tree Synthesis

被引:1
作者
Liu, Wulong [1 ]
Wang, Yu [1 ]
Chen, Guoqing [2 ]
Ma, Yuchun [3 ]
Xie, Yuan [4 ]
Yang, Huazhong [1 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[2] AMD China Res Lab, Beijing 100190, Peoples R China
[3] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China
[4] Univ Calif Santa Barbara, Dept Elect & Comp Engn, Santa Barbara, CA 93106 USA
基金
中国国家自然科学基金;
关键词
3-D integrated circuits (3-D ICs); clock tree synthesis (CTS); through-silicon-via (TSV) arrangement; whitespace; THROUGH-SILICON; OPTIMIZATION; DESIGN;
D O I
10.1109/TVLSI.2014.2354347
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Through-silicon-via (TSV) could provide vertical connections among different dies in 3-D integrated circuits (3-D ICs), but the significant silicon area occupied by TSVs may bring great challenge to designers in 3-D clock tree synthesis (CTS), because only a few whitespace blocks can be used for clock TSV insertion after floorplan and placement are determined, specifically in the area-efficient 3-D IC designs. This paper proposes a whitespace-aware TSV arrangement algorithm in 3-D CTS, which mainly consists of three stages: sink preclustering, whitespace-aware 3-D method of means and medians (3-D-MMMs) topology generation, and deferred-merge embedding merging segment reconstruction. By leveraging the TSV-to-TSV coupling model, we also propose an efficient clock TSV arrangement method to alleviate the coupling effect of adjacent TSVs. Compared with the traditional 3-D-MMM-based CTS with TSV moving adjustment, the experimental results show that our proposed algorithm is more practical and efficient, achieving 49.2% reduction on the average skew and 1.9% reduction on the average power.
引用
收藏
页码:1842 / 1853
页数:12
相关论文
共 31 条
[1]  
[Anonymous], 2006, ACM Journal on Emerging Technologies in Computing Systems, DOI [10.1145/1148015.1148016, DOI 10.1145/1148015.1148016]
[2]  
[Anonymous], P IEEE IEDM
[3]   ZERO SKEW CLOCK ROUTING WITH MINIMUM WIRELENGTH [J].
CHAO, TH ;
HSU, YC ;
HO, JM ;
BOESE, KD ;
KAHNG, AB .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1992, 39 (11) :799-814
[4]  
Chen FW, 2012, DES AUT CON, P1094
[5]  
Cho J, 2009, ELECTRICAL PERFORMANCE OF ELECTRONIC PACKAGING AND SYSTEMS, P97, DOI 10.1109/EPEPS.2009.5338469
[6]  
Hsu MK, 2011, DES AUT CON, P664
[7]  
Jackson M. A. B., 1990, 27th ACM/IEEE Design Automation Conference. Proceedings 1990 (Cat. No.90CH2894-4), P573, DOI 10.1109/DAC.1990.114920
[8]  
Jae-Seok Yang, 2011, 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011, P621, DOI 10.1109/ASPDAC.2011.5722264
[9]  
Jin-Ho Kim, 2010, 2010 14th Biennial IEEE Conference on Electromagnetic Field Computation (CEFC 2010), DOI 10.1109/CEFC.2010.5481044
[10]   Resource Allocation and Design Techniques of Prebond Testable 3-D Clock Tree [J].
Kim, Tak-Yung ;
Kim, Taewhan .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (01) :138-151