{'fraction_non_alphanumeric': 0.026652452025586353, 'fraction_numerical': 0.0, 'mean_word_length': 5.218543046357616, '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}}
On the Wait-free Power of Iterated-immediate-snapshots

The Iterated Immediate Snapshot model, introduced recently, has proved its usefulness. Its rich structure provided alternative simple derivation of past results, and its topological equivalence to the Euclidean Unit Simplex provides insights into new problems. Central to the model usefulness is the fact that it was shown to be non-blocking equivalent to the Atomic-Snapshot memory model and as a result equivalent to the message-passing system. Yet, to investigate long-lived tasks we need a stronger notion of equivalence, wait-free equivalence, rather than just non-blocking one. This paper provides a new generalized deenition of wait-free implementationand correspondingly a novel algorithm that establishes the wait-free equivalence of the models. As a by product, it motivates an alternative elegant characterization of tasks that are t-resiliently solvable in the AS model.