19 citations · 37 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 1 cited
Analysis and Evaluation of Non-Blocking Interpolation Search Trees
Aleksandar Prokopec, Trevor Brown, Dan Alistarh
We start by summarizing the recently proposed implementation of the first non-blocking concurrent interpolation search tree (C-IST) data structure. We then analyze the individual o…
cs.DS2017★ 5 cited
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations
Aleksandar Prokopec
Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable iterators. However, operations on most existing concu…
cs.DS2017★ 11 cited
Cache-Aware Lock-Free Concurrent Hash Tries
Aleksandar Prokopec, Phil Bagwell, Martin Odersky
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operation…