{'fraction_non_alphanumeric': 0.023628048780487805, 'fraction_numerical': 0.0038109756097560975, 'mean_word_length': 5.6313131313131315, '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}}
Minimizing node contention in multiple multicast on wormhole k-ary n-cube networks

This paper presents a new approach to minimize node contention while performing multiple multicast on wormhole k-ary n-cube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because these algorithms have been designed with only single multicast in mind. Our algorithms use only local source-specific information, and no global knowledge about other concurrent multicasts. For systems supporting unicast message passing, a new SPUmesh (Source-Partitioned Umesh) algorithm is proposed and shown to be superior than the conventional Umesh algorithm for multiple multicast. Two new algorithms, SQHL (Source-Quadrant Hierarchical Leader) and SCHL (Source-Centered Hierarchical Leader) are proposed for systems with multidestination message-passing, and shown to be superior than the HL scheme. All these algorithms perform (1) 5-10 times faster than the existing algorithms under multiple multicast and (2) as fast as existing algorithms under single multicast. Such results related to multiple multicast are the first of their kind in the wormhole literature and demonstrate significant potential for current and future wormhole systems.