A Simple Optimistic Skiplist Algorithm

DOI10.1007/978-3-540-72951-8_11zbMath1201.68043OpenAlexW1517389573MaRDI QIDQ5425965

Yossi Lev, Nir Shavit, Victor Luchangco, Maurice P. Herlihy

Publication date: 15 November 2007

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_11

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Distributed algorithms (68W15)

Related Items (6)

Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure ⋮ The splay-list: a distribution-adaptive concurrent skip-list ⋮ The CB tree: a practical concurrent self-adjusting search tree ⋮ Unnamed Item ⋮ NUMASK: High Performance Scalable Skip List for NUMA ⋮ A Concurrent Implementation of Skip Graphs

This page was built for publication: A Simple Optimistic Skiplist Algorithm