A Simple Optimistic Skiplist Algorithm

DOI10.1007/978-3-540-72951-8_11zbMATH Open1201.68043OpenAlexW1517389573MaRDI QIDQ5425965FDOQ5425965

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

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

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)

Cited In (11)

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

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)