{'fraction_non_alphanumeric': 0.01706036745406824, 'fraction_numerical': 0.0026246719160104987, 'mean_word_length': 5.153225806451613, '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}}
Load balanced deadlock-free deterministic routing of arbitrary networks

This paper provides efficient algorithms to deadlock-free route arbitrary multiprocessor interconnection networks as follows:
1. An algorithm is derived for fixed directory routing on an arbitrary network topology such that messages will be routed via one of the shortest routes whilst maintaining an even distribution of traffic over the network (assuming that messages are generated and absorbed in an even manner, or two-phase random routing is used).
2. An algorithm is presented which will evenly map virtual links onto the routed network so that it will be deadlock-free using the minimum number of buffer classes per physical link, thus maximising the buffer size per virtual link.
