Analysis and Evaluation of Non-Blocking Interpolation Search Trees

Prokopec Aleksandar
Prokopec Aleksandar
Brown Trevor
Brown Trevor
Cited by: 0|Bibtex|Views4|Links

Abstract:

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 operations of the C-IST, and show that they are correct and linearizable. We furthermore show that lookup (and several other non-destructive operations) are wa...More

Code:

Data:

Your rating :
0

 

Tags
Comments