TY - GEN
T1 - Nontrivial and universal helping for wait-free queues and stacks
AU - Attiya, Hagit
AU - Castañeda, Armando
AU - Hendler, Danny
N1 - Funding Information:
Supported by the Israel Science Foundation (grant 1749/14). Supported partially by PAPIIT-UNAM IA101015. This research was partially done while the second author was at the Department of Computer Science of the Technion, supported by an Aly Kaufman post-doctoral fellowship.
Publisher Copyright:
© Hagit Attiya, Armando Castañeda, and Danny Hendler.
PY - 2016/9/1
Y1 - 2016/9/1
N2 - 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.
AB - 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.
KW - Common2
KW - Helping
KW - Nonblocking
KW - Queues
KW - Stacks
KW - Wait-free
UR - http://www.scopus.com/inward/record.url?scp=85013472517&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.OPODIS.2015.31
DO - 10.4230/LIPIcs.OPODIS.2015.31
M3 - Conference contribution
AN - SCOPUS:85013472517
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 31.1-31.16
BT - 19th International Conference on Principles of Distributed Systems, OPODIS 2015
A2 - Anceaume, Emmanuelle
A2 - Cachin, Christian
A2 - Potop-Butucaru, Maria
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 19th International Conference on Principles of Distributed Systems, OPODIS 2015
Y2 - 14 December 2015 through 17 December 2015
ER -