<div>The MichaelScott lockefree queues in that repository pass tests and should work. Additional stress testing and feedback would be appreciated. There are some other queues in the literature that might be worth implementing but I think other data structures are higher priority.</div>
<div><br></div><div>As Adam Foltzer mentioned in the trac ticket a really good structure would be the concurrent bags from this paper:</div><div><br></div><div><span class="Apple-style-span" style="font-family:Verdana,Arial,'Bitstream Vera Sans',Helvetica,sans-serif;font-size:13px"> <a class="ext-link" href="http://www.cse.chalmers.se/~tsigas/papers/Lock%20Free%20Bag%20SPAA11.pdf" style="text-decoration:none;color:rgb(85,85,85);border-bottom-width:1px;border-bottom-style:dotted;border-bottom-color:rgb(187,187,187);background-color:rgb(238,238,238)">http://www.cse.chalmers.se/~tsigas/papers/Lock%20Free%20Bag%20SPAA11.pdf</a> </span><br>
</div><div><br></div><div>We separately did a C implementation of those and they performed really well in our bake-off of producer consumer data structures (vs. TBB queues, and many other implementations). By the way, we can share the code for this little bake-off as a performance baseline for the Haskell versions.</div>
<div><br></div><div>I'm less familiar with the literature on concurrent hash tables. TBB's have been a little bit underwhelming in performance. But it's definitely an important structure. Ditto for priority queues.</div>
<div><br></div><div>In any case, I welcome your interest in the topic, Florian!</div><div><br></div><div>Cheers,</div><div> -Ryan</div><div><br></div><br><br><div class="gmail_quote">On Mon, Mar 19, 2012 at 7:33 AM, Florian Hartwig <span dir="ltr"><<a href="mailto:florian.j.hartwig@gmail.com">florian.j.hartwig@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">On 19 March 2012 09:56, Gregory Collins <<a href="mailto:greg@gregorycollins.net">greg@gregorycollins.net</a>> wrote:<br>
> A lock-free concurrent queue alone would be worth a summer project IMO.<br>
><br>
> G<br>
<br>
</div>Ryan Newton is already doing that<br>
(<a href="https://github.com/rrnewton/haskell-lockfree-queue" target="_blank">https://github.com/rrnewton/haskell-lockfree-queue</a>).<br>
<div class="HOEnZb"><div class="h5"><br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br>