{'fraction_non_alphanumeric': 0.015544041450777202, 'fraction_numerical': 0.004145077720207254, 'mean_word_length': 5.0, '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 new selection policy for adaptive routing in network on chip

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present a new selection policy that can be coupled to any adaptive routing algorithm to improve the performance in terms of average delay. The proposed approach introduce the concept of Neighbors-on-Path to exploit the situations of indecision occurring when the routing function returns several admissible output channels. A selection strategy is developed with the aim to choose the channel that will allow the packet to be routed to its destination along a path that is as free as possible of congested nodes. Experimental comparisons between the proposed approach against both the deterministic XY routing and current state-of-the-art of adaptive routing algorithm for different traffic scenarios show an improvement in terms of saturation point respectively of 36% and almost 10% in average.