Lock Free Queue Implementation

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处开始消耗结点。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值