The lock-free queue implementation is based on the paper A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue by Ruslan Nikolaev. Nikolaev's paper provides an overview of various methods for implementing lock-free queues. This implementation specifically adopts the SCQ (Scalable Circular Queue) approach, which is designed for bounded queues. However, this approach can be easily extended to support unbounded FIFO queues capable of storing an arbitrary number of elements.
In addition, this implementation employs a hazard pointer-based memory reclamation system for concurrent queues.