Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems — mentioned by mrcode007

Sat, 20 Dec 2025 01:26:09 GMT

Yes. [1] has background, [2] has the implementation (fig 2. pseudocode). Since you understood my comment I trust you can figure out the rest :) it’s a very neat trick. [1]https://www.microsoft.com/en-us/research/publication/concurr... [2]https://arxiv.org/pdf/1012.1824

Paper and discussion history. A mention is not an endorsement.

Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems — mentioned by mjpt777

Sun, 29 Mar 2015 21:24:06 GMT

I've read the _The Art of Multiprocessor Programming_ and am happy to read it again. Maybe I have misinterpreted. So if "killed mid-operation" must be supported then I don't see how many algorithms can be said to make progress. Take for example the Lamport SPSC queue[1], if the producer gets killed mid operation between steps 4 and 5 of the push operation. Then the data is in the queue but the consumer is blocked from ever seeing it with this line of reasoning. The Lamport SPSC queue is considered wait-free by the concurrency community I know. I base my reasoning on this. What if the producer…

Paper and discussion history. A mention is not an endorsement.

Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems · HackerPapers discussions

Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems — mentioned by mrcode007

Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems — mentioned by mjpt777