A Speculation-Friendly Binary Search Tree

Abstract : We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate transactional memory using such tree structures whose prominent example is the red-black tree library developed by Oracle Labs that is part of multiple benchmark distributions. Although well-engineered, such structures remain badly suited for speculative accesses, whose step complexity might raise dramatically with contention. We show that our speculation-friendly tree outperforms the existing transaction-based version of the AVL and the red-black trees. Its key novelty stems from the decoupling of update operations: they are split into one transaction that modifies the abstraction state and multiple ones that restructure its tree implementation in the background. In particular, the speculation-friendly tree is shown correct, reusable and it speeds up a transaction-based travel reservation application by up to 3:5 .
Type de document :
[Research Report] PI-1984, 2011, pp.21
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

Contributeur : Ist Rennes <>
Soumis le : lundi 5 mars 2012 - 09:10:14
Dernière modification le : vendredi 16 novembre 2018 - 01:40:28
Document(s) archivé(s) le : mercredi 14 décembre 2016 - 10:15:45


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00618995, version 2


Tyler Crain, Vincent Gramoli, Michel Raynal. A Speculation-Friendly Binary Search Tree. [Research Report] PI-1984, 2011, pp.21. 〈inria-00618995v2〉



Consultations de la notice


Téléchargements de fichiers