Brief announcement: a contention-friendly, non-blocking skip list

Authors:
Tyler Crain;Vincent Gramoli;Michel Raynal
Affiliations:
IRISA, Rennes Cedex, France;The University of Sydney, NSW, Australia;IRISA, Rennes Cedex, France,Institut Universitaire de France, France
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 6
Cited 1

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
High performance dynamic lock-free hash tables and list-based sets

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A Pragmatic Implementation of Non-blocking Linked-Lists

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Scalable and lock-free concurrent dictionaries

Proceedings of the 2004 ACM symposium on Applied computing
Lock-free linked lists and skip lists

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A speculation-friendly binary search tree

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

A contention-friendly binary search tree

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A skip list is a probabilistic data structure to store and retrieve in-memory data in an efficient way. In short, it is a linked structure that diminishes the linear big-oh complexity of a linked list with elements having additional shortcuts pointing towards other elements located further in the list [7]. These shortcuts allow operations to complete in O(logn) steps in expectation. The drawback of employing shortcuts is however to require additional maintenance each time some data is stored or discarded.