期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

预先指定单元位置的时延驱动布局优化方法

Timing-Driven Placement via Preassigning Cell
下载PDF
导出
摘要 为了在时延驱动的布局算法中减少关键路径的数量,提出一种预先指定单元位置的基于线性规划优化时延驱动的布局方法.在全局布局每次迭代优化后提取关键子电路,建立子电路的时延模型;应用线性规划优化并移动子电路上各单元位置形成新的初始布局,进行下一次布局迭代.将该方法嵌入到力指向的布局器Kraftwerk中的实验结果表明,最小负时延裕量提高了21 ps,负时延裕量总和平均提高了483 ps,同时线长仅增加了0.83%. For the purpose of reducing the number of the critical paths in timing-driven placement,a powerful new technique to optimize timing via preassigning cell based on linear programming（LP） is represented.The new locations of the cells on the timing critical sub-circuits are optimized by LP and the cells are preassigned to the new locations before the next placement iteration.This method is embedded into the global force directed placement process of Kraftwerk,and the experimental results show that the average worst slack improves 21ps and average total negative slack reduces 483ps while the average wire length only increases 0.83%.
作者 刘大为 周强 边计年
机构地区 清华大学计算机科学与技术系 清华信息科学与技术国家实验室(筹)
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2010年第10期1695-1700,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(60876026 60833004)
关键词 VLSI 时延 布局 线性规划 VLSI timing placement linear programming
分类号 TP302 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献14

  • 1Swartz W, Sechen C. Timing driven placement for large standard cell circuits [C] //Proceedings of Design Automation Conference. New York: ACM Press, 1995:211-215.
  • 2Kahng A B, large-scale International ACM Press, Mantik S, Markov I L. Min-max placement for timing optimization [C]//Proceedings of Symposium on Physical Design. New York: 2002:143-148.
  • 3Chowdhary A, Rajagopal K, Venkatesan S, et al. How accurately can we model timing in a placement engine? [C] // Proceedings of Design Automation Conference. New York:ACM Press, 2005 : 801-806.
  • 4Halpin B, Chen C Y R, Sehgal N. Timing driven placement using physical net constraints [C] //Proceedings of Design Automation Conference. New York: ACM Press, 2001: 780- 783.
  • 5Renx H X, Pan D Z, Kung D S. Sensitivity guided net weighting for placement driven synthesis [C] //Proceedings of International Symposium on Physical Design. New York: ACM Press, 2004: 10-17.
  • 6Kong T T. A novel net weighting algorithm for timing-driven placement[C]//Proceeding of International Conference on Computer Aided Design. Washington D C: IEEE Computer Society Press, 2002:172-176.
  • 7Rajagopal K, Shaked T, Parasuram Y, et al. Timing driven force directed placement with physical net constraints [C] // Proceeding of International Symposium on Physical Design. New York: ACM Press, 2003:60-66.
  • 8Choi W, Bazargan K. Incremental placement for timing optimization [C]//Proceedings of International Conference on Computer Aided Design. Washington D C: IEEE Computer Society Press, 2003:463-466.
  • 9Papa D A, Luo T, Moffitt M D, et al. RUMBLE: an incremental, timing-driven, physical synthesis optimization algorithm[C]//Proceedings of International Symposium on Physical Design. New York: ACM Press, 2008: 2-9.
  • 10Wang Q Z, Lillis J, Sanyal S. An LP-based methodology for improved timing-driven placement [C] //Proceedings of Asia and South Pacific Design Automation Conference. New York: ACM Press, 2005:1139-1143.

二级参考文献1

  • 1Belouadah H, Posner M E, Potts C N. Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time.Discrete Applied Mathematics,1992, 36:213-231

共引文献6

计算机辅助设计与图形学学报
2010年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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