{'fraction_non_alphanumeric': 0.017082785808147174, 'fraction_numerical': 0.002628120893561104, 'mean_word_length': 5.512820512820513, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An efficient search space smoothing based netlist partitioning

Partitioning is important in many phases of modern VLSI hierarchical design. The search space smoothing concept has received much attention recently on solving combinational optimization since it improves local search quality. In this paper, we define a new net weight metric based on hypergraph model and present an alternate smoothing process. A size constraint partitioning approach, based on well-known Fiduccia-Mattheyses algorithm with search space smoothing, is also proposed, which not only inherits the efficiency, but also enhances the quality of partition. Experimental results on industry benchmark suites show an average of 10% reduction of cutsize with the same predefined cut ratio.