Asynchronous Latency and Fast Atomic Snapshot
<|reference_start|>Asynchronous Latency and Fast Atomic Snapshot: The original goal of this paper was a novel, fast atomic-snapshot protocol for asynchronous message-passing systems. In the process of defining what fast means exactly, we faced a number of interesting issues that arise when conventional time metrics are applied to asynchronous implementations. We discovered some gaps in latency claims made in earlier work on snapshot algorithms, which hampers their comparative time-complexity analysis. We then came up with a new unifying time-complexity analysis that captures the latency of an operation in an asynchronous, long-lived implementation, which allowed us to formally grasp latency improvements of our solution with respect to the state-of-the-art protocols: optimal latency in fault-free runs without contention, short constant latency in fault-free runs with contention, the worst-case latency proportional to the number of failures, and constant, close to optimal amortized latency.<|reference_end|>
@article{bezerra2024asynchronous,
    title={Asynchronous Latency and Fast Atomic Snapshot},
    author={Jo~ao Paulo Bezerra, Luciano Freitas, Petr Kuznetsov},
    journal={arXiv preprint arXiv:2408.02562},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.02562},
    primaryClass={cs.DC}
}