Benchmarking Code and Additional Results for "Contention Adapting Search Trees"
This page contains code that can be used to reproduce the results included in the following publication:
- Konstantinos Sagonas and Kjell Winblad. Contention Adapting Search Trees
. In Proceedings of the Fourteenth International Symposium on Parallel and Distributed Computing, Limassol, Cyprus, July 2015. (publisher's version
, preprint
)
More information about how to use the benchmark code can be found in the included README.md file.
This page contains more information about CA trees.
Please, contact Kjell Winblad (kjell.winblad@it.uu.se) if you have any questions.
Basic Set Operations Benchmark
A Java benchmark for the CA tree as well as CA tree implementations can be downloaded here. See the README.md file in the archive for more details. Our Java AVL-tree based CA tree implementation with basic set operations has also been included in the Synchrobench benchmark suite
.
This PDF document contains graphs for the benchmark described in the technical report
mentioned above. It is recommended to view the graphs with a PDF reader that support zooming in and out to study the different scenarios.
Hardware Lock Elision (HLE) Benchmark
A benchmark for the HLE extension of the CA tree as well as CA tree implementations written in C can be downloaded here. See the README.md file in the archive for more details.
This PDF document contains graphs from a benchmark run on an Intel(R) Xeon(R) CPU E3-1230 v3 (3.30GHz), 4 cores with hyperthreading (8 logical cores), and 16GB of RAM running Ubuntu 13.10.