Multiway partitioning with pairwise movement

It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway partitioning problem. However, little progress has been made to identify and overcome the weakness of the direct alternatively called at approach. In this paper, we make the rst observation that the performance of iterative improvement-based at multiway partitioner K-FM 10, 11 is not suitable for today's large scale circuits. Then, we propose a simple yet e ective hill-climbing method called PM Pairwise cell Movement that overcomes the limitation of K-FM and provides partitioners the capability to explore wider range of solution space e ectively while ensuring convergence to satisfying suboptimal solutions. The main idea is to reduce the multiway partitioning problem to sets of concurrent bipartitioning problems. Starting with an initial multiway partition of the netlist, we apply 2-way FM 7 to pairs of bloc...

• Type: Conference
• Year: 1998
• Where: ICCAD
• Authors: Jason Cong, Sung Kyu Lim
• Keywords: Hardware, ICCAD 1998, Multiway Partitioner, Multiway Partitioning, Multiway Partitioning Problem