{'fraction_non_alphanumeric': 0.03406813627254509, 'fraction_numerical': 0.001002004008016032, 'mean_word_length': 4.77456647398844, '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}}
KMS-Cube — A general alternative to hypercubes for reducing the node degree

As the scale of parallel computer systems becomes larger year by year, interconnection networks with low node degree and short diameter are required for achieving high communication performance at low cost. This paper presents a general alternative to hypercubes, named KMS-Cube, that keeps interesting topological properties of the hypercube but has a low node degree. A KMS-Cube, denoted by KMSC(k, m, s), is configured with three parameters k, m, and s. The node address has m2k−s + k bits and the node degree is k + m, much less than that of hypercubes. Comparing to other alternatives to hypercubes, KMS-Cube has advantages such as the ease of routing and the flexibility of changing network size. We describe the KMS-Cube's structure and its topological properties, compare it with other networks on the measures of node degree, diameter, and cost ratio, and present an efficient routing algorithm for the KMS-Cube.