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

基于线性规划的最小扰动标准单元合法化算法 被引量：1

Legalization Algorithm for Minimum Perturbation Centric Standard Cell Based on Linear-Programming
原文传递
导出
摘要 在传统的标准单元总体布局完成之后,一个很重要的步骤是消除标准单元之间的重叠,即合法化过程。文章以对总体布局结果的最小扰动为优化目标,考虑标准单元布局合理位置的约束,通过采用线性规划建模求解,有效地解决了布局合法化问题。与启发式算法相比,该模型从理论上给出了对布局造成最小扰动的最优解。实验表明,该合法化算法在ISPD02的例子中基于mPL6的总体布局能够比Fastplace3.0的合法化结果有平均3.8%的线长减少。 Placement legalization removes overlaps among cells after global placement,and moves cells to their final position.A linear programming was described based on placement legalization algorithm.To achieve minimum perturbation on global placement and considering site constraint,a linear programming model was proposed to solve the problem of placement legalization.Theoretically,the model gave the optimal solution to minimum perturbation on placement.The algorithm was tested on mPL6 global placement on ISPD02 benchmarks.Experiment results showed that the algorithm can reduce the wire length by 3.8% in average,as compared to legalization using FastPlace3.0.
作者 陈福真 闫海霞 吕勇强 周强
机构地区 清华大学计算机科学与技术系
出处 《微电子学》 CAS CSCD 北大核心 2010年第5期738-743,共6页 Microelectronics
基金 国家自然科学基金资助项目(60876026 60833004)
关键词 线性规划 标准单元 布局合法化 超大规模集成电路 Linear programming Standard cell Placement legalization VLSI
分类号 TN47 [电子电信—微电子学与固体电子学]
  • 相关文献

参考文献17

  • 1ROY J A,PAPA D A,ADYA S N,et al. Capo:robust and scalable open-source min-cut floorplacer [C] //Proe ACM/IEEE Int Syrup Phys Des. San Francisco, USA. 2005:224 226.
  • 2AGNIHOTRI A, ONO S, MADDEN P. Recursive bi- section placement: Feng Shui 5. 0 implementation details [C] // Proc ACM/IEEE Int Symp Phys Des. San Francisco, USA. 2005 : 230-232.
  • 3TAGHAVI T, YANG X, CHOI B K, et al. DRAG- ON2005..large-scale mixed-size placement tool [C] // Proc ACM/IEEE Int Symp Phys Des. San Francisco, USA. 2005: 245-247.
  • 4TAGHAVI T, YANG X, CHOI B K, et al, DRAG- ON2006 : blockage-aware congestion-controlling mixedsize placer [C] // Proc ACM/IEEE Int Syrup Phys Des. San Jose, USA. 2006: 209-211.
  • 5KAHNG A B, REDA S, WANG Q. APlace.-a general analytic placement framework [C] // Proc ACM/ IEEE Int Syrup Phys Des. San Francisco, USA. 2005: 233-235.
  • 6KAHNG A B, WANG Q. A faster implementation of APlace [C] // Proc ACM/IEEE Int Symp Phys Des. San Jose, USA. 2006.. 218-220.
  • 7CHANT F,CONG J,ROMESIS M,et al. mPL6:a robust multilevel mixed-size placement engine [C] // Proc ACM/IEEE Int Syrup Phys Des. San Francisco, USA. 2005: 227-229.
  • 8CHANT F, CONG J,SHINNERL J R, et al. mPL6.enhanced multilevel mixed-size placement [C] // Proc ACM/IEEE Int Syrup Phys Des. San Jose, USA. 2006:212 214.
  • 9VISWANATHAN N,PAN M,CHU C C-N. FastPlace..an analytical placer for mixed-mode designs [C] // Proc ACM/IEEE Int Symp Phys Des. San Francisco, USA. 2005.. 221-223.
  • 10HILL D. Method and system for high speed detailed placement of cells within an integrated circuit design: US Patent 6370673 [P]. 2002.

二级参考文献9

  • 1BETZ V. Architecture and CAD for the speed and area optimization of FPGAs [D]. PhD Dissertation. Toronto: University of Toronto, 1998.
  • 2CHENG C. RISA: accurate and efficient placement mutability modeling [C]// IEEE/ACM Int Conf Comp Aid ,San Jose, CA, USA. 1994: 690-695.
  • 3HUANG M, ROMEO F, SANGIOVANNI-VINCENTELLI A. An efficient general cooling schedule for simulated annealing [C]//ICCAD. Santa Clara, CA,USA. 1986: 381-384.
  • 4SWARTZ W, SECHEN C. New algorithms for the placement and routing of macro cells [C] // ICCAD. Santa Clara, CA, USA. 1990: 336-339.
  • 5FLEXERA. 1 K APGA Device Datasheet [Z]. Agate Logic, Inc. 2007.
  • 6CHEN Deming, CONG J. FPGA design automation: a survey [J]. Foundations and Trends in Electronic Design Automation, 2006, 1(3): 195-330.
  • 7BETZ V, ROSE J. VPR: a new packing, placement and routing tool for FPGA research [C]// IWFPLA. London, UK. 1997: 213-222.
  • 8MAIDEE P, ABABEI C, BAZARGA K. Timing-driven partitioning-based placement for Island style FPGAs [J]. IEEE Trans Comp Aid Des Integr Cire and Syst, 2005, 24(3): 395-406.
  • 9黄志军,张鹏,童家榕.FPGA/CPLD结构分析[J].微电子学,1998,28(5):345-353. 被引量：9

共引文献1

同被引文献10

  • 1LUO L J, ZHOU Q, CAI Y C, et al. A novel teehnique integrating buffer insertion into timing driven placement [C] // IEEE Int Symp Cire Syst. Island of Kos, Greece. 2006.
  • 2WANG Y B, CAI Y C, HONG X L. An interconnect optimization algorithm in SOC layout design [J]. Chinese J Semieond, 2003, 24(5): 550-555.
  • 3KONGT M, HONG X L, QIAO C G. VEAP: a global optimization based placement algorithm for standard cell design [C] // Proc Asia South Pacific Des Automa Conf. 1997: 277-280.
  • 4ZHOU Q, LUO L J, HONG X Let al. Better initial placement algorithm for large-scale mixed-mode detailed placement [J]. Chinese J Semicond, 2004, 25 (7) : 784-789.
  • 5BRENNER U, VYGEN J. Legalizing a placement with minimum total movement [J]. IEEE Trans Comp Aid Des Integr Circ Syst, 2004, 23(12): 1597-1613.
  • 6ALPERT C J, MEHTA D P, SAPATNEKAR S S. Handbook of algorithms for physical design automation[M]. New York: CRC Press, 2008.
  • 7CHOU Y C, LIN Y L. A performance-driven standard cell placer based on a modified force-directed algorithm [C] // ACM Proc Int Syrup Phys Des. New York, NY, USA. 2001: 24-29.
  • 8张峥,周强,钱旭,刘攀,曹雪.线长驱动的层次式FPGA布局算法[J].微电子学,2009,39(3):429-433. 被引量：2
  • 9钱海涛,李威,张大华,牛莉,刘洋.反熔丝FPGA布局布线算法研究[J].微电子学,2013,43(4):550-553. 被引量：3
  • 10谢凡荣.运输网络中求最小费用最大流的一个算法[J].运筹与管理,2000,9(4):33-38. 被引量：32

引证文献1

二级引证文献1

微电子学
2010年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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