{'fraction_non_alphanumeric': 0.01744186046511628, 'fraction_numerical': 0.0, 'mean_word_length': 5.572519083969466, '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 Routing Algorithm in Triple-Based Hierarchical Interconnection Network

Triple-based hierarchical interconnection network (THIN) is not only a new kind of direct networks but also a kind of HIN's. Efficient routing algorithm is very essential to the performance of the interconnection network and the parallel computing system. This paper presents DDRA (distributed deterministic routing algorithm) routing algorithm in triple-based hierarchical interconnection network. Fully applying the hierarchical characteristic of the network, DDRA routing algorithm just uses the node address to determine an approximate minimal path between source and destination node, without constructing the route table on each node. The analysis based on the simulation of DDRA shows it is not only very simple and easy to be implemented in hardware, but has high efficiency