shreyas-gopalakrishna / Concurrent-Skip-list

The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operations can be performed together across multiple threads. The implementation uses hand-over-hand locking to access nodes for writing and atomic variables while reading (no locks needed while reading).
20Updated 3 years ago

Related projects

Alternatives and complementary repositories for Concurrent-Skip-list