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… (More)
DOI: 10.1145/2145816.2145837

7 Figures and Tables

Topics

Statistics

01020302012201320142015201620172018
Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics