A Concurrent Unbounded Wait-Free Graph
share
In this paper, we propose a concurrent non-blocking unbounded directed graph (for shared memory architecture) that is concurrently being updated by threads adding/deleting vertices and edges. All the methods of the algorithm are wait-free in nature. We extend the wait-free list implementation of concurrent set for achieving this. We have compared the performance of the proposed concurrent data-structure with coarse-grained, hand-over-hand, fine-grained locking and lock-free implementation and achieves significant improvement. We also extended our implementation using fast-path-slow-path based on the algorithm proposed by Timnat et al.
READ FULL TEXT