Brief Announcement: A Concurrency-Optimal List-Based Set - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Brief Announcement: A Concurrency-Optimal List-Based Set

Résumé

Multicore applications require highly concurrent data structures. Yet, the very notion of concurrency is vaguely defined, to say the least. What is meant by a “highly concurrent” data structure implementing a given high-level object type? Generally speaking, one could compare the concurrency of algorithms by running a game where an adversary decides on the schedules of shared memory accesses from different processes. At the end of the game, the more schedules the algorithm would accept without hampering high-level correctness, the more concurrent it would be. The algorithm that accepts all correct schedules would then be considered concurrency-optimal.
Fichier principal
Vignette du fichier
37-BA.pdf (161.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01207872 , version 1 (01-10-2015)

Identifiants

  • HAL Id : hal-01207872 , version 1

Citer

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang. Brief Announcement: A Concurrency-Optimal List-Based Set. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨hal-01207872⟩
155 Consultations
144 Téléchargements

Partager

Gmail Facebook X LinkedIn More