{'fraction_non_alphanumeric': 0.011210762331838564, 'fraction_numerical': 0.013452914798206279, 'mean_word_length': 4.730769230769231, '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}}
Experiences with the Intel Hypercube

This paper presents a comparative analysis of the performance of two different parallel algorithms for solving the prefix problem on the Intel Hypercube. Estimates of the key parameters that determine the cost of communication between nodes are also given. It turns out that the ratio of communication cost to that of unit computation is quite high (is in the range of 240 to 470) for this class of machines.