互连驱动的基于最小自由度优先原则的布局算法

Interconnection driven placement algorithm based on LFF principle

在超大规模集成电路的布局问题中,布局模块间的互连特性变得日益重要。基于最小自由度优先的算法是一种有效的确定性布局算法,能够快速有效地解决布局问题。修改了原算法中局部互连的自由度,使用了更精确的模型,提出了一种全局互连的自由度,防止布局结果落入极小值区域,进一步改善了互连特性。实验结果证明,该方法在得到较好面积利用率的同时改善了互连的效果。

In VLSI placement problem, interconnection becomes more important. The deterministic algorithm for VLSI block placement based on less flexibility first (LFF) principle is efficient. The definition of the flexibility of local interconnection and a more exact model was used. In order to void getting the local minimum result, a new flexibility of global interconnection was proposed. Experimental results showed the algorithm could reduce the total wirelength cost with achieving good placement area usage.