A simple optimistic skiplist algorithm

Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Because of their highly distributed nature and the lack of global rebalancing, skiplists are becoming an increasingly important logarithmic search structure for concurrent applications. Unfortunately, none of the concurrent skiplist implementations in the literature, whether lock-based or lock-free, have been proven correct. Moreover, the complex structure of these algorithms, most likely the reason for a lack of a proof, is a barrier to software designers that wish to extend and modify the algorithms or base new structures on them. This paper proposes a simple new lock-based concurrent skiplist algorithm. Unlike other concurrent skiplist algorithms, this algorithm preserves the skiplist properties at all times, which facilitates reasoning about its correctness. Though it is lock-based, the algorithm is highly scalable due to a novel use of optimistic synchronization: it searches without acquiring locks, requiring only a short lock-based validation before adding or removing nodes. Experimental evidence shows that this simpler algorithm performs as well as the best previously known lock-free algorithm under the most common search patterns.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540729181
StatePublished - 2007
Event14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 - Castiglioncello, Italy
Duration: 5 Jun 20078 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4474 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007


Dive into the research topics of 'A simple optimistic skiplist algorithm'. Together they form a unique fingerprint.

Cite this