On Helping and Stacks

Abstract : A concurrent algorithm exhibits helping when one process performs work on behalf of other processes. More formally, helping is observed when the order of some operation in a linearization is fixed by a step of another process. In this paper, we show that no wait-free linearizable implementation of a stack using read, write, compare&swap and fetch&add operations can be help-free, correcting a mistake in an earlier proof by Censor-Hillel et al.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01888607
Contributor : Vitalii Aksenov <>
Submitted on : Friday, October 5, 2018 - 11:13:34 AM
Last modification on : Thursday, November 8, 2018 - 4:54:57 PM
Long-term archiving on : Sunday, January 6, 2019 - 2:28:01 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01888607, version 1

Collections

Citation

Vitalii Aksenov, Petr Kuznetsov, Anatoly Shalyto. On Helping and Stacks. The International Conference on Networked Systems, May 2018, Essaouira, Morocco. ⟨hal-01888607⟩

Share

Metrics

Record views

68

Files downloads

67