{'fraction_non_alphanumeric': 0.017763845350052248, 'fraction_numerical': 0.009404388714733543, 'mean_word_length': 4.877300613496932, '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 Method for Deadlock Elimination in Computer Networks With Irregular Toplologies

* This work has been supported by NSF grant MIP-9630096 Abstract In this paper we consider the problem of deadlock-free wormhole unicast routing in networks with irregular topologies. To prevent deadlocks, for each router some input/output pairs (turns) have to be prohibited. We analyze the problem of minimizing the number of prohibited turns for providing deadlock-free routing. A new algorithm is proposed, which guarantees that this number does not exceed 1/3 of the total number of turns and that it is still possible to send messages between any two initially connected nodes. To the best of our knowledge this is the first meaningful upper bound on the fraction of turns to be prohibited to prevent deadlocks for networks with an irregular toplogy. Also, the problem of routing in the presence of prohibited turns is considered and appropriate methods developed.