2000 character limit reached
Generalized Compare and Swap
Published 24 Oct 2024 in cs.DC | (2410.19102v1)
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.
- P. Fatourou and N. D. Kallimanis, “The redblue adaptive universal constructions,” in International Symposium on Distributed Computing, pp. 127–141, Springer, 2009.
- M. Herlihy, “Wait-free synchronization,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 13, no. 1, pp. 124–149, 1991.
- P. Fatourou and N. D. Kallimanis, “A highly-efficient wait-free universal construction,” in Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, pp. 325–334, 2011.
- J. H. Anderson and M. Moir, “Universal constructions for multi-object operations,” in Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pp. 184–193, 1995.
- P. Chuong, F. Ellen, and V. Ramachandran, “A universal construction for wait-free transaction friendly data structures,” in Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, pp. 335–344, 2010.
- Y. Afek, D. Dauber, and D. Touitou, “Wait-free made fast,” in Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pp. 538–547, 1995.
- H. Naderibeni and E. Ruppert, “A wait-free queue with polylogarithmic step complexity,” in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 124–134, 2023.
- M. M. Michael and M. L. Scott, “Simple, fast, and practical non-blocking and blocking concurrent queue algorithms,” in Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 267–275, 1996.
- M. Merritt and G. Taubenfeld, “Computing with infinitely many processes: Under assumptions on concurrency and participation,” in International Symposium on Distributed Computing, pp. 164–178, Springer, 2000.
- M. P. Herlihy and J. M. Wing, “Linearizability: A correctness condition for concurrent objects,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 12, no. 3, pp. 463–492, 1990.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.