Benchmarking Code for "Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data"

This archive contains code that can be used to reproduce the results included in the following publication:

• Kjell Winblad. Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data. In the proceedings of 2017 Imperial College Computing Student Workshop (ICCSW 2017), London, United Kingdom, September 2017. (publisher's version, preprint, Code for reproducing results)

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.