一类超大规模集成电路分割算法的改进

An improved algorithm for VLSI circuit partitioning

提出了一个超大规模集成电路分割算法 ,从流图中最小截之间的等价关系出发 ,寻找新的电路割集 .与同类分割算法 ,如FBB算法、DMC算法相比 ,新算法充分利用了流图拓扑结构的特点 ,分割结果更好 .

This paper presents an algorithm for the optimization of VLSI circuit partitioning. Based on equivalent relations between minimum cut sets, new circuit cut can be found. Compared with the FBB algorithm and the DMC algorithm, the characteristic in flow graph is exploited fully. The results demonstrate that the new algorithm outperforms the FBB algorithm and the DMC algorithm in terms of the number of cut edges.