Generalized Compare and Swap
Distributed, Parallel, and Cluster Computing
2024-10-28 v1
Abstract
In this paper, we first propose a natural generalization of the well-known compare-and-swap object, one that replaces the equality comparison with an arbitrary comparator. We then present a simple wait-free universal construction using this object and prove its correctness.
Cite
@article{arxiv.2410.19102,
title = {Generalized Compare and Swap},
author = {Vassos Hadzilacos and Myles Thiessen and Sam Toueg},
journal= {arXiv preprint arXiv:2410.19102},
year = {2024}
}
Comments
12 pages