{'fraction_non_alphanumeric': 0.02912621359223301, 'fraction_numerical': 0.015533980582524271, 'mean_word_length': 5.142857142857143, '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 progressive two-stage global routing for macro-cell based designs

We propose a two-stage global routing algorithm based on mixed integer programming and a novel network-flow model. Results from various test cases including a subset of routes on a commercial 64-bit microprocessor core show that our method outperforms commercial CCT router. On average, we achieved 29% less delay violations, 40% less repeater usage on resulting routing-trees, 20% less maximum delay violation and better congestion distribution.