期刊文献+

应用于三维集成电路解析式布局的层分配算法 被引量:2

Chip layer assignment method for analytical placement of 3D ICs
下载PDF
导出
摘要 层分配是解析式三维集成电路布局算法中的关键一步。解析式布局需要通过层分配将连续的三维空间中的单元划分到二维的芯片层上,这个过程会破坏之前三维空间中得到的连续解。为了实现从优化的三维布局到合法的多层二维结构的平滑过渡,提出一种使用最小代价流的层分配方法,尽可能地继承三维优化结果,保护解空间。将此层分配算法嵌入到多层次的解析式三维集成电路布局算法中,以总线长和穿透硅通孔数目的加权总和为目标,面积密度为约束条件,对比当前其他三维布局算法,该算法得到较好的线长结果、穿透硅通孔数量和运行时间。 Chip layer assignment is a key step in analytical placement of 3D Integrated Circuits (ICs). Analytical placement could face the conversion from 3D continuous space in z-direction to several connected 2D chip layer spaces by layer assignment. However, layer assignment may destroy the previous optimal solution in 3D continuous space. To realize the transition from an optimal 3D placement to a legalized, layer-assigned placement smoothly, a layer assignment method was proposed by using the minimum cost flow, which protected solution space and inherited optimal wirelength at most. The layer assignment method was embedded in a multilevel non-linear placement of 3D ICs which minimized the weighted sum of total wirelength and Through Silicon Via (TSV) number subject to area density constraints. The proposed placement algorithm can achieve better wirelength results, TSV number and run time in comparison with the recent 3I) placement methods.
出处 《计算机应用》 CSCD 北大核心 2013年第6期1548-1552,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61176035 60833004)
关键词 层分配 解析式布局算法 三维集成电路 穿透硅通孔 最小代价流 layer assignment analytical placement 3D IC Through Silicon Via (TSV) minimum cost flow
  • 相关文献

参考文献16

  • 1徐宁,洪先龙.超大规模集成电路物理设计理论与算法【M].北京:清华大学出版社,2009.
  • 2CONG J, LUO G, WEI J, et al. Thermal-aware 3D IC placement via transformation] C]// Proceedings of the the 2007 Conference on Asia South Pacific Design Automation. Japan: Yokohama, 2007: 780 -785.
  • 3GOPLEN B, SAPATNEKAR S. Efficient thermal placement of standard cells in 3 D ICs using a force directed approach[C]// Pro-ceedings of the 2003 IEEEI ACM International Conference on Com-puter-Aided Design. Washington, DC: IEEE Computer Society, 2003: 86 -89.
  • 4GOPLEN B, SAPATNEKAR S. Placement of 3D ICs with thermal and interlayer via considerations[C]// Proceedings of the 44th ACMlIEEE Design Automation Conference. New York: ACM, 2007: 626 -631.
  • 5YAN H, ZHOU Q, HONG X. Efficient thermal aware placement approach integrated with 3 D DCT placement algorithm[C]// Pro-ceedings of the 9th International Symposium on Quality Electronic Design. Washington, DC: IEEE Computer Society, 2008: 289 - 292.
  • 6HSU M K, CHANG Y W, BALABANOV V. TSV-aware analytical placement for 3D IC designs[C]II Proceedings of the 48th Design Automation Conference. New York: ACM, 2011: 664 - 669.
  • 7CONG J, LUO G. A multilevel analytical placement for 3 D ICs[C]// Proceedings of the 2009 Asia and South Pacific Design Auto-mation Conference. Piscataway: IEEE, 2009: 361 - 366.
  • 8NAYLOR WC, DONELLYR, SHAL. Non-linearoptimizationsys-tern and method for wire . length and delay optimization for an auto-matic electric circuit placer: USA, 6301693[P] , 2001.
  • 9CHAN T, CONG J, SZE K. Multilevel generalized force-directed method for circuit placement[C]// Proceedings of the 2005 Interna-tional Symposium on Physical Design. New York: ACM, 2005: 185 -192.
  • 10KAHNG A B, RESA S, WANG Q. Architecture and details of a high quality, large-scale analytical placer] C]// Proceedings of the 2005 IEEE! ACM International Conference on Computer-aided De-sign. Washington, DC: IEEE Computer Society, 2005: 890 -897.

二级参考文献15

  • 1Betz V, Rose J. VPR: a new packing, placement and routing tool for FPGA research [C] //Proceedings of the 7thInternational Workshop on Field-Programmable Logic and Applications. London: Springer, 1997: 1-10.
  • 2Tsay R S, Kuh E S, Hsu C P. Proud:a sea-of-gates placement algorithm [C] //Proceedings of the 25th ACM/IEEE Design Automation Conferenee. Los Alamitos:IEEE Computer Society Press, 1988:44-56.
  • 3RoyJ A, Papa D A, Adya S N, et al. Capo: robust and scalable open-source rain-cut floorplacer [C] //Proceedings ofIEEE/ACM International Conference on Physical Design. New York: ACM Press, 2005: 224-226.
  • 4Viswanathan N, Chu C C N. FastPlace: efficient analytical placement using cell shifting, iterative local refinement and ahybrid net model [C]//Proceedings of International Symposium on Physical Design. New York: ACM Press, 2004 :26-33.
  • 5Kleinhands J M, Sigl G, Johannes F M, et al. GORDIAN: VLSI placement by quadratic programming and slicingoptimization [J]. IEEE Transactions on Computer-Aided Design, 1991, 10(3):356-365.
  • 6Srinivasan A, Chaudhary K, Kuh E S. RITUAL: aperformance driven placement algorithm[J]. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992, 39(11): 825-840.
  • 7Naylor W C. Non-linear optimization system and method for wire length and delay optimization for an automatic electriccircuit placer: USA, 6301693[P]. 2001-10-09.
  • 8Kahng A B, Reda S, Wang Q. Aplace:a general analytic placement framework [C] //Proceedings of InternationalSymposium on Physical Design. New York: ACM Press, 2005:233-235.
  • 9Kahng A B, Reda S, Wang Q. Architecture and details of a high quality, large-scale analytical placer [C] //Proceedings ofIEEE/ACM International Conference on Computer-Aided Design. Los Alamitos: IEEE Computer Society Press, 2005: 890-897.
  • 10Kahng A B, Wang Q. A faster implementation of APlace [C]//Proceedings of International Symposium on Physical Design. New York: ACM Press, 2006: 218-220.

共引文献13

同被引文献24

  • 1何鹏,陆建新,施佺,陈继红.一种园区级网络拓扑图布局算法[J].微计算机信息,2007,23(03X):143-145. 被引量:5
  • 2Rohrer R M,Swing E.Web-based information visualization[J].Computer Graphics and Applications,1997,17(4):52-59.
  • 3孙小红,武伟磊.基于标量场的网络拓扑布局算法[C].中国计算机用户协会信息系统分会2008 年信息交流大会论文集,2008:196-199.
  • 4Eades P.A heuristic for graph drawing[J].Congressus Numerantium,1984,42:149-160.
  • 5Kamada T,Kawai S.An algorithm for drawing generalundirected graphs[J].Information Processing Letters,1989,31(1):7-15.
  • 6Davidson R,Harel D.Drawing graphs nicely using simulatedannealing[J].ACM Transactions on Graphics,1996,15(4):301-303.
  • 7Fruchterman T M J,Reingold E M.Graph drawing by forcedirectedplacement[J].Software:Practice and Experience,1991,21(11):1129-1164.
  • 8Noack A.Graph drawing[M].Berlin/Heidelberg:Springer,2004:425-436.
  • 9Frick A,Ludwig A,Mehldau H.A fast adaptive layoutalgorithm for undirected graphs[C].Graph Drawing.Berlin/Heidelberg:Springer,1995:388-403.
  • 10姜栋,郑康蜂,胡影.基于蚁群的启发式网络拓扑图布局算法[C].第九届中国通信学会学术会论文集,2012:97-101.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部