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

Ryan Newton rrnewton at gmail.com
Thu Mar 29 15:12:22 CEST 2012

On Thu, Mar 29, 2012 at 9:01 AM, Gregory Collins <greg at gregorycollins.net>wrote:

> 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.

Yes, absolutely... I'd like to add the byte array versions.  Actually,
those don't have GC write barriers so they should be much easier to get
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120329/98d064ff/attachment.htm>

More information about the Haskell-Cafe mailing list