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.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207872
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:43:05 PM
Last modification on : Tuesday, October 6, 2015 - 1:00:41 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:11:56 AM

File

37-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207872, version 1

Collections

Citation

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang. Brief Announcement: A Concurrency-Optimal List-Based Set. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207872〉

Share

Metrics

Record views

67

Files downloads

95