Skip to Main content Skip to Navigation
Conference papers

Brief Announcement: A Concurrency-Optimal List-Based Set

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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Matthieu Roy Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 2:43:05 PM
Last modification on : Friday, April 9, 2021 - 4:28:05 PM
Long-term archiving on: : Saturday, January 2, 2016 - 11:11:56 AM


Files produced by the author(s)


  • HAL Id : hal-01207872, version 1


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⟩



Record views


Files downloads