Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 502 Bytes

README.md

File metadata and controls

7 lines (6 loc) · 502 Bytes

Concurrent queue implementation from scratch

Following along Michael and Scott (M&S) lock-free queue algorithm are described in their PODC 1996 paper. This impl is using atomic operations to ensure thread safety without locking. Based on the paper, the queue is implemented as a linked list with a sentinel node.

Benchmarking

The benchmarking demonstrates the performance of the concurrent queue compared to the lock-based queue.