{'fraction_non_alphanumeric': 0.029439696106362774, 'fraction_numerical': 0.0, 'mean_word_length': 5.236686390532545, '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}}
Using a Hypercube Algorithm for Broadcasting in Internet-Based Clusters

Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way of obtaining great performance, it may not always be so. When using such a cluster for executing a parallel application, performance may not be as good as expected due to delays in communication . Also, the heterogeneity in communication makes it hard to take advantage, or reuse, communication strategies that were useful in regular-topology platforms, e.g., parallel machines or LAN-based clusters of workstations. For instance, broadcasting in an internet-based cluster may be more challenging due to the variety of communication links and, consequently, of point-to-point latencies. In this paper, we present a strategy to improve hypercube-based broadcasting algorithms that are used in regular-topol ogy platforms, so that they can execute efficiently in internet-based clusters of workstations.