基于优化合并准则的团划分算法

Clique Partitioning Algorithms Based on Improved Merging Rules

图论中的团划分算法 ,对于高级综合中的分配有重要意义 ,目前高级综合中广泛采用的是C .J.Tseng等提出的近似算法 .文中通过分析完全点和二分点的情况 ,提出了两个合并准则 ,指导改进了目前的团划分算法 .经模拟测试表明 。

Clique partitioning is an important algorithm in data path synthesis. The present partition algorithm given by C.J. Tseng is widely used in high level synthesis. By analyzing the instance of complete-point and bi-partition point, two merge rules are presented to improve the partition algorithm. The experiments show that the partition results are improved notably by using the revised algorithm.