NUMASK: high performance scalable skip list for NUMA

DOI10.4230/LIPICS.DISC.2018.18zbMATH Open1497.68139OpenAlexW2898653777MaRDI QIDQ5090909FDOQ5090909

Authors:

Publication date: 21 July 2022

Full work available at URL: http://dblp.uni-trier.de/db/conf/wdag/disc2018.html#DalyHSP18

Recommendations

• A Simple Optimistic Skiplist Algorithm
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• A concurrent implementation of skip graphs
• TSLQueue: an efficient lock-free design for priority queues
• The SkipTrie, low-depth concurrent search without rebalancing

zbMATH Keywords

skip listNUMAconcurrent data structure

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• A Simple Optimistic Skiplist Algorithm

Cited In (1)

• NUMASK

Uses Software

• Synchrobench

This page was built for publication: NUMASK: high performance scalable skip list for NUMA

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