{'fraction_non_alphanumeric': 0.01951219512195122, 'fraction_numerical': 0.0, 'mean_word_length': 5.5828877005347595, '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}}
An Efficient Deterministic Edge Traffic Distribution Network-on-chip Routing Algorithm Design

Network-on-chip architectures emerged as promising solutions for future system-on-chip communication architecture designs. However, the switching and routing algorithm design of network-on-chip communication architectures are still facing great challenges. To address the deficiencies of the existing routing algorithms, a new deterministic network-on-chip routing algorithm-Edge Traffic Distribution routing and its specifics are proposed in this paper. In the proposed algorithm, the traffic which involves the edge routers will be directed to go through the edges first instead of entering into the center of the network. It will greatly alleviate the congestion around the center of the network so as to help improve the overall system performance. Simulation of the proposed Edge Traffic Distribution algorithm and three existing routing algorithms has been carried out using NIRGAM network-on-chip simulator. Simulation results illustrate that the performance of the Edge Traffic Distribution routing algorithm exceeds the performance of the existing routing algorithms in term of average latency and network power consumption. 