{'fraction_non_alphanumeric': 0.013223140495867768, 'fraction_numerical': 0.0, 'mean_word_length': 5.446808510638298, '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}}
Communication Reduced Parallel Multigrid: Analysis and Experiments

The most common technique for the parallelization of multigrid methods is grid partitioning. For such methods Brandt and Diskin have suggested the use of a variant of segmental reenement in order to reduce the amount of inter{processor communication. A parallel multigrid method with this technique avoids all communication on the nest grid levels. This article will examine some features of this class of algorithms as compared to standard parallel multigrid methods. In particular, the communication pattern will be analysed in detail.