Lock Free Queue Implementation

iteye_15479

于 2012-09-05 16:29:31 发布

阅读量153

点赞数

CC 4.0 BY-SA版权

分类专栏： algorithm 文章标签： lock free queue

本文链接：https://blog.youkuaiyun.com/iteye_15479/article/details/82406988

algorithm 专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一种解决一对一生产者消费者问题的方法：通过在列表中添加分隔符来实现无锁队列。此方法确保了分隔符之后的节点归消费者所有并进行消费，而分隔符之前的节点则由生产者收集并只允许生产者向队列末尾追加新节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

One consumer, one producer problem:

[url="http://www.drdobbs.com/parallel/writing-lock-free-code-a-corrected-queue/210604448?pgno=1"]Lock Free Queue[/url]

Basically add one a separator in a list then nodes between separator and last is owned by consumer, the node between first and separator should be collected by producer and producer only append new nodes to the last.

This problem is also described in the book [b]Java Concurrency in Practice[/b].

[img]http://dl.iteye.com/upload/attachment/0075/8103/2faacb36-a547-3510-848e-5e73a0b8339b.gif[/img]

见上图，producer从last处插入结点，consumer从divider处开始消耗结点。