@inproceedings{872324bd923b4d1d9702dff6f9ea3b0d,
title = "Nontrivial and universal helping for wait-free queues and stacks",
abstract = "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 waitfree 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.",
keywords = "Common2, Helping, Nonblocking, Queues, Stacks, Wait-free",
author = "Hagit Attiya and Armando Casta{\~n}eda and Danny Hendler",
note = "Publisher Copyright: {\textcopyright} Hagit Attiya, Armando Casta{\~n}eda, and Danny Hendler.; 19th International Conference on Principles of Distributed Systems, OPODIS 2015 ; Conference date: 14-12-2015 Through 17-12-2015",
year = "2016",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.OPODIS.2015.31",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "31.1--31.16",
editor = "Emmanuelle Anceaume and Christian Cachin and Maria Potop-Butucaru",
booktitle = "19th International Conference on Principles of Distributed Systems, OPODIS 2015",
address = "Germany",
}