Lock-free Contention Adapting Search Trees
- Kjell Winblad, Konstantinos Sagonas and Bengt Jonsson. Lock-free Contention Adapting Search Trees. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2018. (preprint, publisher's version)
The SPAA'2018 paper erroneously claims that the lookup operation of the LFCA tree is wait-free, but it is only lock-free. Please contact the authors for more information on this issue and a possible fix.
Tests for Pseudocode
This page contains information about the lock-based CA tree.
Please, contact Kjell Winblad (email@example.com) if you have any questions.