First work-optimal parallel finger search structures, with the simpler FS1 and the faster pipelined FS2, both provably matching the sequential finger bound under a greedy scheduler.
The cb tree: a practical concurrent self-adjusting search tree
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parallel Finger Search Structures
First work-optimal parallel finger search structures, with the simpler FS1 and the faster pipelined FS2, both provably matching the sequential finger bound under a greedy scheduler.