Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was thinking, is it possible to have a lockless queue when more than one thread is reading or writing? I’ve seen an implementation with a lockless queue that worked with one read and one write thread but never more than one for either. Is it possible? I don’t think it is. Can/does anyone want to prove it?
There are multiple algorithms available, I ended up implementing the An Optimistic Approach to Lock-Free FIFO Queues, which avoids the ABA problem via pointer-tagging (needs the
CMPXCHG8Binstruction onx86), and it runs fine in a production app (written in Delphi). (Another version, with Java code)Nevertheless, to be really-really lockless, you would also need a lock-free memory allocator – see Scalable Lock-Free Dynamic Memory Allocation (implemented in Concurrent Building Block) or NBMalloc (but so far, I didn’t get to use one of these).
You may also want to look at answers for optimistic lock-free FIFO queues impl?