{'fraction_non_alphanumeric': 0.02631578947368421, 'fraction_numerical': 0.0, 'mean_word_length': 6.833333333333333, '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}}
Multipath routing algorithm for application‐specific wormhole NoCs

Adaptive routing designing for network‐on‐chip architecture is complicated to guarantee deadlock‐free. In this paper, we present methodology to design efficient multi‐path routing algorithms for specific application wormhole network‐on‐chip system to guarantee deadlock‐free. The methodology presents an analytical model for overall average delay of wormhole network‐on‐chip by queueing theory and uses a linear programming–based methodology to minimize overall average delay. The methodology guarantees deadlock freedom by efficient branch‐and‐bound algorithm. Compared to other adaptive deadlock‐free algorithms, results obtained through simulation show that the algorithms can potentially achieve better throughput and latency.