2026-07-26T17:24:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6620 2024-03-06T10:36:52Z ddc:004 open_access

Nontrivial and Universal Helping for Wait-Free Queues and Stacks Attiya, Hagit Castaneda, Armando Hendler, Danny helping wait-free nonblocking queues stacks common2 This paper studies two approaches to formalize helping in wait-free implementations of shared objects. The first approach is based on operation valency, and it allows us to make the important distinction between trivial and nontrivial helping. We show that a wait-free implementation of a queue from common2 objects (e.g., Test&Set) requires nontrivial helping. In contrast, there is a wait-free implementation of a stack from Common2 objects with only trivial helping. This separation might shed light on the difficulty of implementing a queue from Common2 objects. The other approach formalizes the helping mechanism employed by Herlihy's universal wait-free construction and is based on having an operation by one process restrict the possible linearizations of operations by other processes. We show that objects possessing such universal helping can be used to solve consensus. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hagit Attiya and Armando Castaneda and Danny Hendler 2016 Is Part Of LIPIcs, Volume 46, 19th International Conference on Principles of Distributed Systems (OPODIS 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2015.31 urn:nbn:de:0030-drops-66201 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.31 eng https://creativecommons.org/licenses/by/3.0/legalcode