{'fraction_non_alphanumeric': 0.015738498789346248, 'fraction_numerical': 0.0, 'mean_word_length': 5.616, '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}}
Weak Memory Consistency Models

Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern multiprocessors present a large variety of memory models that are anything but sequentially consistent. In these machines, the ordering constraints on memory accesses are few. We re-address two fundamental process coordination problems in the context of weak memory models. We prove that many models cannot support a solution to the critical section problem without additional powerful synchronization primitives. Nevertheless, we show that certain versions of the producer/consumer problem can be solved even in the weakest models without the need for such powerful instructions. These instructions are expensive, and avoiding their use is desirable for better performance.