{'fraction_non_alphanumeric': 0.02198952879581152, 'fraction_numerical': 0.0, 'mean_word_length': 6.0814814814814815, '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}}
Reducing contention in multiple multicasts

Multicast operation plays a significant role in parallel computing. Most multicast algorithms that have been proposed for single multicast deliver poor performance when applied to multiple multicasts, because the destination sets of different multicasts often overlap, which leads to node contention in multiple multicasts. The paper presents two algorithms, SPTBM (Source Partitioned Tree-Based Multidestination) and SHTBM (Source Half-divided Tree-Based Multidestination), using source based information to partition the network and reduce contention in multiple multicasts. Although these two algorithms are based on TBM (Tree-Based Multidestination) designed for single multicast, simulation results show SPTBM is superior to TBM, and SHTBM outperforms TBM and SPTBM with the increase of system size. These algorithms demonstrate potential to implement fast and scalable collective communication operations.