{'fraction_non_alphanumeric': 0.018970189701897018, 'fraction_numerical': 0.0018066847335140017, 'mean_word_length': 5.7560975609756095, '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}}
Early Transition for Fully Adaptive Routing Algorithms in On-Chip Interconnection Networks

Interconnection networks have become prevalent not only in massively parallel processing systems, but also in chip multiprocessors. Unlike off-chip interconnection networks, limited available resources in on-chip interconnection networks mandate to choose simple routing algorithms which, in turn, provide low throughput. Fully adaptive routing algorithms improve throughput, but need escape channels for a deadlock recovery technique resulting in low utilization. To improve utilization, we propose an early transition scheme where packets are transferred to the escape channels earlier, before the normal channels are full. Our evaluation results using a cycle-accurate network simulator show that our proposed scheme improves network throughput up to 12% in a concentrated mesh, compared to Duato’s fully adaptive routing algorithm. Because the proposed scheme has better utilization in the escape channels, the early transition scheme is less sensitive to the ratio of the escape channels to the total channels.