A Concurrency-Optimal Binary Search Tree - Equipe Autonomic and Critical Embedded Systems Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A Concurrency-Optimal Binary Search Tree

Résumé

The paper presents the first \emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every \emph{schedule} is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree \emph{edges} in addition to nodes. Our implementation outperforms the state-of-the art BSTs on most basic workloads, which suggests that optimizing the set of accepted schedules of the sequential code can be an adequate design principle for efficient concurrent data structures.

Dates et versions

hal-01664898 , version 1 (15-12-2017)

Identifiants

Citer

Vitalii Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi. A Concurrency-Optimal Binary Search Tree. 23rd International European Conference on Parallel and Distributed Computing - Euro-Par 2017, Aug 2017, Santiago de Compostella, Spain. ⟨hal-01664898⟩
228 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More