{'fraction_non_alphanumeric': 0.017676767676767676, 'fraction_numerical': 0.0, 'mean_word_length': 5.395161290322581, '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}}
Hypercube versus Torus under Pin-Out Constraint and Finite Buffers

Previous studies have shown that when the network is subject to the pin-out constraint, the network topology exhibiting the best performance depends on the network size. These studies have assumed single flit buffers. Deploying finite size buffers, however, may add extra complexity to the router design and hence will influence the cost and the performance of the network. This paper reinvestigates analytically the relative performance merits of different k-ary n-cube topologies combining wormhole switching, adaptive routing, multiple virtual channels and finite size buffers. The results reveal new insights demonstrating the sensitivity of these studies to the level of detail and realism incorporated in the analysis.