Browsing University of Waterloo by Subject "b-trees"
Now showing items 1-1 of 1
-
Extremely fast (a,b)-trees at all contention levels
(University of Waterloo, 2021-08-26)Many concurrent dictionary implementations are designed and evaluated with only low-contention workloads in mind. This thesis presents several concurrent linearizable (a,b)-tree implementations with the overarching goal ...