HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01888607
Contributor : Vitalii Aksenov Connect in order to contact the contributor
Submitted on : Friday, October 5, 2018 - 11:13:34 AM
Last modification on : Friday, February 4, 2022 - 3:09:58 AM
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

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

76

Files downloads

165