# The Splay-List: A Distribution-Adaptive Concurrent Skip-List

@inproceedings{Aksenov2020TheSA,
title={The Splay-List: A Distribution-Adaptive Concurrent Skip-List},
author={V. Aksenov and Dan Alistarh and Alexandra Drozdova and Amirkeivan Mohtashami},
booktitle={DISC},
year={2020}
}
The design and implementation of efficient concurrent data structures have seen significant attention. However, most of this work has focused on concurrent data structures providing good \emph{worst-case} guarantees. In real workloads, objects are often accessed at different rates, since access distributions may be non-uniform. Efficient distribution-adaptive data structures are known in the sequential case, e.g. the splay-trees; however, they often are hard to translate efficiently in the… Expand

#### References

SHOWING 1-10 OF 22 REFERENCES
The splay-list: A distribution-adaptive concurrent skip-list
• arXiv preprint arXiv:2008.01009,
• 2020
Getting to the Root of Concurrent Binary Search Tree Performance
• Computer Science
• USENIX Annual Technical Conference
• 2018
This paper focuses on optimistic binary search trees and performs a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. Expand
Techniques for Constructing Efficient Data Structures
• PhD thesis, PhD thesis, University of Toronto,
• 2017
• 2015
Fast concurrent lock-free binary search trees
• Computer Science
• PPoPP '14
• 2014
A new lock-free algorithm for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations and significantly outperforms all other algorithms for a concurrent binarysearch tree in many cases. Expand
CBTree: A Practical Concurrent Self-Adjusting Search Tree
• Computer Science
• DISC
• 2012
The CBTree is presented, a new counting-based self-adjusting binary search tree that moves more frequently accessed nodes closer to the root that improves performance compared to existing concurrent search trees on non-uniform access sequences derived from real workloads. Expand
Benchmarking cloud serving systems with YCSB
• Computer Science
• SoCC '10
• 2010
This work presents the "Yahoo! Cloud Serving Benchmark" (YCSB) framework, with the goal of facilitating performance comparisons of the new generation of cloud data serving systems, and defines a core set of benchmarks and reports results for four widely used systems. Expand
Non-blocking binary search trees
• Computer Science
• PODC
• 2010
This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementationExpand
Dynamic optimality for skip lists and B-trees
• Mathematics, Computer Science
• SODA '08
• 2008
This work proves that for a class of skip lists that satisfy a weak balancing property, the working-set bound is a lower bound on the time to access any sequence, and develops a deterministic self-adjusting skip list whose running time matches theWorking- set bound, thereby achieving dynamic optimality in this class. Expand