Brief Announcement: A Concurrency-Optimal List-Based Set - Archive ouverte HAL Access content directly
Conference Papers Year :

Brief Announcement: A Concurrency-Optimal List-Based Set

(1, 2) , (3) , (4) , (1)
1
2
3
4

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01207872 , version 1

Cite

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⟩
127 View
121 Download

Share

Gmail Facebook Twitter LinkedIn More