{'fraction_non_alphanumeric': 0.021996615905245348, 'fraction_numerical': 0.0, 'mean_word_length': 5.804597701149425, '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}}
Locality in distributed computations

The defining characteristic of a distributed system is the (temporal) distance between components; communication time is non-trivial compared to processing time. Because of this, the design of efficient distributed computations involves trade-offs between maximizing the amount of parallelism and minimizing communication costs. We argue that any sort of centralized control, whether in user-level algorithms or at the systems level, impairs efficiency. We then introduce a scheme for automatic process synchronization that meets our locality criterion.