An improved objective function for mincut circuit partitioning

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers Pub Date : 1988-11-07 DOI:10.1109/ICCAD.1988.122558

C. Sechen, Dahe Chen

引用次数: 57

Abstract

An improved objective function has been added to the Kernighan-Lin (1970), Fiduccia-Mattheyses (1982) (KLFM) partitioning algorithm. The time complexity of the enhanced KLFM algorithm remains linear in the number of pins, and there is essentially no change in the CPU time requirements. Based on circuit bipartitioning tests with ten industrial circuits, the number of nets cut was reduced by as much as 55% with the new objective function. The average reduction in nets cut was 38%.<>

查看原文本刊更多论文

一种改进的最小切割电路划分目标函数

在Kernighan-Lin (1970)， Fiduccia-Mattheyses (1982) (KLFM)划分算法中加入了一个改进的目标函数。增强KLFM算法的时间复杂度在引脚数上保持线性，CPU时间需求基本没有变化。基于10个工业电路的电路双分区测试，采用新的目标函数可减少多达55%的网络切割数量。蚊帐平均减少38%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers

自引率

0.00%

发文量