Two-level partitioning algorithm with stable performance

TL;DR: This paper presents a ratio cut partitioning algorithm which provides stable results without executing the algorithm over many trials, and employs a preprocessing circuit-clustering procedure to improve the performance.

Abstract: By using the concept of 'divide-and-conquer' the complexity of a large problem can be reduced efficiently Therefore, logic partitioning plays an important role in many aspects of VLSI design The ratio cut objective function has attracted much attention because it coordinates the two traditional goals of logic partitioning, mincut and equipartition, automatically How to reduce the total trials needed to run and maintain the quality of solutions is very important to the iterative improvement-based partitioning algorithms In this paper we present a ratio cut partitioning algorithm which provides stable results without executing the algorithm over many trials The proposed algorithm also employs a preprocessing circuit-clustering procedure to improve the performance Our partitioning heuristics were tested on some industry benchmark suites Good experimental results, which are better than those obtained by RCut10 and EIG1-IG algorithms, have been observed