Brief Announcement: A Concurrency-Optimal List-Based Set

Vincent Gramoli (1, 2) , Petr Kuznetsov (3) , Srivatsan Ravi (4) , Di Shang (1)

1 The University of Sydney
2 NICTA - National ICT Australia [Sydney]
3 Télécom ParisTech
4 TU - Technical University of Berlin / Technische Universität Berlin

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.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

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⟩