To explore multi-core programming, we re-implement the Lock Free Contention Adapting Search Tree. We follow the structure of the original, using immutable treaps as leaf nodes implemented with an array for better performance with memory caching. The initial re-implementation uses coarse-grained locking with MRLock to provide thread-safety. This will be extended to be lock-free in a future publication.
Author and article information
] University of Central Florida
This work has been published open access under Creative Commons Attribution License
CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided
can be found at