On Helping and Stacks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

On Helping and Stacks

Petr Kuznetsov
Anatoly Shalyto
  • Function : Author
  • PersonId : 1011937


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.
Fichier principal
Vignette du fichier
main.pdf (349.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01888607 , version 1 (05-10-2018)


  • HAL Id : hal-01888607 , version 1


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


Gmail Facebook Twitter LinkedIn More