Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven partitioning methods based on iterated net reweighting, partitioning and timing analysis have been proposed [2], as well as methods that apply degrees of freedom such as retiming [7][5]. In this work, we identify and validate a simple approach to timing-driven partitioning, based on the concept of "V-shaped nodes". We observe that the presence of V-shaped nodes can badly impact circuit performance, as measured by maximum hopcount across the cutline or similar path delay criteria. We extend traditional KLFM approaches to directly eliminate or minimize "distance-kV-shaped nodes" in the bipartitioning solution, achieving a smooth trade-off between cutsize and path delay. Experiments show that in comparison to MLPart [4], our method can reduce the maximum hopcount by 39% while only slightly increasingcutsize and runtime. No previous method improves path delay in such a transparent manner.
展开▼
机译：传统的多级分区方法在削减大小方面表现出良好的性能，但在系统性能方面却无法提供保证。已经提出了基于迭代网络重加权，分区和时序分析的时序驱动分区方法[2]，以及应用了自由度的方法，例如重定时[7] [5]。在这项工作中，我们基于“ V 形节点”的概念，确定并验证了一种简单的时序驱动分区方法。我们观察到， V 形节点的存在会严重影响电路性能，这可以通过跨割线的最大跳数或类似的路径延迟标准来衡量。我们扩展了传统的KLFM方法，以直接消除或最小化分割解决方案中的“距离- k V 型节点”，从而在切割尺寸和路径延迟之间实现了平稳的权衡。实验表明，与MLPart [4]相比，我们的方法可以将最大跃点数减少39％，同时仅略微增加剪切大小和运行时间。以前的方法都没有以这种透明的方式改善路径延迟。
展开▼
