{'fraction_non_alphanumeric': 0.025039123630672927, 'fraction_numerical': 0.012519561815336464, 'mean_word_length': 5.095238095238095, '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}}
Iterative convergence of optimal wire sizing and available buffer insertion for zero-skew clock tree optimization

In this paper, based on the topology of one DME-based zero-skew clock tree, the analysis of the optimal width of one wire segment and the information of available buffers on one wire segment, an iterative convergence-based algorithm is proposed to assign the optimal width and insert available buffers onto any wire segment to reduce the clock delay. The experimental results show that our proposed OWSABI algorithm reduces 78%~88% clock delay and 20%~28% total load capacitance in one DME-based zero-skew clock routing tree