{'fraction_non_alphanumeric': 0.02753195673549656, 'fraction_numerical': 0.011799410029498525, 'mean_word_length': 5.283950617283951, '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}}
A Low-Power Buffered Tree Construction Algorithm Aware of Supply Voltage Variation

Power dissipation problem becomes a dominant factor in the state-of-the-art IC design. In this paper, we use accurate delay and power models to construct buffered routing trees with consideration of power optimization under timing constraints. Moreover, with the supply voltage goes down, the supply voltage variation becomes an important part of total supply voltage, and make the traditional timing estimation inaccurate and unreliable. Our algorithm takes the supply voltage variation into account to obtain better solutions. Experimental results show, our method can save 42.8% and 75.9% of power dissipation and total buffer area, respectively. Moreover, with the consideration of supply voltage variation, 12.0% power dissipation and 31.6% total buffer area will be saved compared with the worst case IR-drop estimation, and more reliable solutions are obtained compared with the cases not considering supply voltage variation.