Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Strong Linearizability using Primitives with Consensus Number 2 (2402.13618v1)

Published 21 Feb 2024 in cs.DC

Abstract: A powerful tool for designing complex concurrent programs is through composition with object implementations from lower-level primitives. Strongly-linearizable implementations allow to preserve hyper-properties, e.g., probabilistic guarantees of randomized programs. However, the only known wait-free strongly-linearizable implementations for many objects rely on compare&swap, a universal primitive that allows any number of processes to solve consensus. This is despite the fact that these objects have wait-free linearizable implementations from read / write primitives, which do not support consensus. This paper investigates a middle-ground, asking whether there are wait-free strongly-linearizable implementations from realistic primitives such as test&set or fetch&add, whose consensus number is 2. We show that many objects with consensus number 1 have wait-free strongly-linearizable implementations from fetch&add. We also show that several objects with consensus number 2 have wait-free or lock-free implementations from other objects with consensus number 2. In contrast, we prove that even when fetch&add, swap and test&set primitives are used, some objects with consensus number 2 do not have lock-free strongly-linearizable implementations. This includes queues and stacks, as well as relaxed variants thereof.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Atomic snapshots of shared memory. J. ACM, 40(4):873–890, 1993.
  2. Common2 extended to stacks and unbounded concurrency. Distributed Comput., 20(4):239–252, 2007.
  3. From bounded to unbounded concurrency objects and back. In Proceedings of the 30th annual ACM symposium on Principles of distributed computing, pages 119–128, 2011.
  4. Y. Afek and E. Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68–105, 1999.
  5. A completeness theorem for a class of synchronization objects. In Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, pages 159–170, 1993.
  6. Max registers, counters, and monotone circuits. In Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 36–45, 2009.
  7. J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model. In SPAA, pages 340–349, 1990.
  8. Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput., 121:1–14, 2018.
  9. H. Attiya and C. Enea. Putting strong linearizability in context: Preserving hyperproperties in programsthat use concurrent objects. In 33rd International Symposium on Distributed Computing, DISC, pages 2:1–2:17, 2019.
  10. Impossibility of strongly-linearizable message-passing objects via simulation by single-writer registers. In 35th International Symposium on Distributed Computing (DISC), pages 7:1–7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  11. Set-linearizable implementations from read/write operations: Sets, fetch &increment, stacks and queues with multiplicity. Distributed Comput., 36(2):89–106, 2023.
  12. An impossibility result on strong linearizability in message-passing systems. CoRR, abs/2108.01651, 2021.
  13. Hyperproperties. Journal of Computer Security, 18(6):1157–1210, 2010.
  14. O. Denysyuk and P. Woelfel. Wait-freedom is harder than lock-freedom under strong linearizability. In Distributed Computing - 29th International Symposium (DISC), pages 60–74. Springer, 2015.
  15. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR 2022), 2022.
  16. Linearizable implementations do not suffice for randomized distributed computation. In L. Fortnow and S. P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 373–382. ACM, 2011.
  17. On linearizability and the termination of randomized algorithms. CoRR, abs/2010.15210, 2020.
  18. Strongly linearizable implementations: possibilities and impossibilities. In ACM Symposium on Principles of Distributed Computing (PODC), pages 385–394, New York, NY, USA, 2012. ACM.
  19. Quantitative relaxation of concurrent data structures. In R. Giacobazzi and R. Cousot, editors, The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’13, Rome, Italy - January 23 - 25, 2013, pages 317–328. ACM, 2013.
  20. M. Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1):124–149, 1991.
  21. M. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects (preliminary version). In J. H. Anderson, D. Peleg, and E. Borowsky, editors, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994, pages 324–333. ACM, 1994.
  22. M. Herlihy and N. Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008.
  23. M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463–492, 1990.
  24. S. M. Hwang and P. Woelfel. Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021), 2022.
  25. Z. Li. Non-blocking implementations of queues in asynchronous distributed shared-memory systems. Master Thesis. University of Toronto, 2001.
  26. Recoverable and detectable fetch&add. In 25th International Conference on Principles of Distributed Systems, OPODIS, pages 29:1–29:17, 2021.
  27. S. Ovens and P. Woelfel. Strongly linearizable implementations of snapshots and other types. In PODC, pages 197–206, 2019.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Hagit Attiya (27 papers)
  2. Armando Castañeda (23 papers)
  3. Constantin Enea (38 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets