[Haskell-cafe] Google Summer of Code - Lock-free data structures

Gregory Collins greg at gregorycollins.net
Thu Mar 29 15:01:48 CEST 2012

On Thu, Mar 29, 2012 at 6:57 AM, Ryan Newton <rrnewton at gmail.com> wrote:

> The ByteArray versions will be more annoying, requiring more variations,
> but they are also less essential, because the user can always use
> ForeignPtr and bits-atomic in this case, and I believe for our concurrent
> data structures we want to store arbitrary pointers (hence casArray#).

This is true, although using bits-atomic does a function call (i.e the
calls are not inlined), which would be pretty bad for performance.

Gregory Collins <greg at gregorycollins.net>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120329/ca587815/attachment.htm>

More information about the Haskell-Cafe mailing list