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.
Type de document :
Communication dans un congrès
The International Conference on Networked Systems, May 2018, Essaouira, Morocco
Liste complète des métadonnées

https://hal.inria.fr/hal-01888607
Contributeur : Vitalii Aksenov <>
Soumis le : vendredi 5 octobre 2018 - 11:13:34
Dernière modification le : jeudi 8 novembre 2018 - 16:54:57
Document(s) archivé(s) le : dimanche 6 janvier 2019 - 14:28:01

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

54

Téléchargements de fichiers

44