This repository contains Java programs of concurrent data structures - binary search tree, AVL tree, skiplist, fine-grained-heap. These are a result of study done during undergraduate thesis on concurrent data structures.
References:
- Binary search tree - Non-blocking Binary Search Trees - Faith Ellen Et. al. - PODC’10
- AVL Tree - A Practical Concurrent Binary Search Tree - Nathan G. Bronson Et. al. - PPoPP ’10
- Skiplist and Fine-grained heap - Art of Multiprocessor Programming - Maurice and Herlihy