Collection of lock based data structures for Multicore OCaml
Ms_queue
- With separate head and tail lock.Bounded_queue
- Improved version of michael scott queue with fixed capacity that waits till queue is not empty before popping and queue is not full before pushing.Fine_list
- Fine Grained List based on Optimistic Synchronization.Priority_queue
- Fine grained heap structure, lockfree priority queue based on skiplistDouble_linked_list
- Fine grained list that support O(1) deletion and insertion to the left and right of a node