Skip to content

thaodt/conqueue

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

About

M&S lock-free queue algorithm.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages