一种改进的集成电路模块有效布局算法

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (15): 51-53.

一种改进的集成电路模块有效布局算法

赵新芳,余鹏,杨莹,崔耀东

广西师范大学计算机科学学院，广西桂林 541004

收稿日期:2007-09-10 修回日期:2007-12-04 出版日期:2008-05-21 发布日期:2008-05-21
通讯作者: 赵新芳

Improved effective algorithm for VLSI block placement

ZHAO Xin-fang,YU Peng,YANG Ying,CUI Yao-dong

Department of Computer Science，Guangxi Normal University，Guilin，Guangxi 541004，China

Received:2007-09-10 Revised:2007-12-04 Online:2008-05-21 Published:2008-05-21
Contact: ZHAO Xin-fang

摘要/Abstract

摘要： 改进了一种求解集成电路模块布局问题的启发式算法。以边界矩形周长最小为目标，设计了模块的优先序列，并在布局过程中动态调整，重新设计布局优先度，并简化模块的占边动作，重写占角动作，对模块布局放置的多个可能位置进行比较，并将其放置在优先度最高的适当区域。经实例测试，结果表明该算法简洁高效，面积利用率有较大提高。

关键词: 集成电路模块布局, 边界矩形, 布局优先度

Abstract: This paper presents an improved version of a heuristic algorithm for VLSI module placement.To get the minimum perimeter of the rectangular chip，the authors design the modules’s priority sequence and change it dynamically.The authors then redesign the placement priority，simplify the module’s border-occupation action，rewrite the angle-occupation action and select the position with the highest priority to place the module.Experiments show that the algorithm is effective，easy to implement and can improve the chip utilization level.

Key words: VLSI placement, border rectangle, priority of placement

赵新芳,余鹏,杨莹,崔耀东. 一种改进的集成电路模块有效布局算法[J]. 计算机工程与应用, 2008, 44(15): 51-53.

ZHAO Xin-fang,YU Peng,YANG Ying,CUI Yao-dong. Improved effective algorithm for VLSI block placement[J]. Computer Engineering and Applications, 2008, 44(15): 51-53.

[1]	穆斌,闫金来. 高效的时间序列下界技术[J]. 计算机工程与应用, 2009, 45(11): 168-171.
[2]	张博李毅. 一种改进的VLSI电路有效布局算法[J]. 计算机工程与应用, 2007, 43(13): 243-245.