A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Contention Adapting Search Trees
2015
2015 14th International Symposium on Parallel and Distributed Computing
With multicores being ubiquitous, concurrent data structures are becoming increasingly important. This paper proposes a novel approach to concurrent data structure design where the data structure collects statistics about contention and adapts dynamically according to this statistics. We use this approach to create a contention adapting binary search tree (CA tree) that can be used to implement concurrent ordered sets and maps. Our experimental evaluation shows that CA trees scale similar to
doi:10.1109/ispdc.2015.32
dblp:conf/ispdc/SagonasW15
fatcat:qefbbsx2p5bczg2cikslyingjq