A Simple Optimistic Skiplist Algorithm

DOI10.1007/978-3-540-72951-8_11MaRDI QIDQ5425965zbMATH OpenOpenAlexFDO

Authors Yossi Lev, Victor Luchangco, Nir Shavit, Maurice 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

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

Recommendations

• The SkipTrie, low-depth concurrent search without rebalancing
• scientific article; zbMATH DE number 742983
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• A design of a parallel dictionary using skip lists
• Some observations on skip-lists

Cited in

(11)

• The CB tree: a practical concurrent self-adjusting search tree
• Order out of chaos: proving linearizability using local views
• In the search for optimal concurrency
• The SkipTrie, low-depth concurrent search without rebalancing
• NUMASK: high performance scalable skip list for NUMA
• The splay-list: a distribution-adaptive concurrent skip-list
• The splay-list: a distribution-adaptive concurrent skip-list
• scientific article; zbMATH DE number 742983 (Why is no real title available?)
• A concurrent implementation of skip graphs
• Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure
• Leaplist: lessons learned in designing TM-supported range queries

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425965)