[Haskell-cafe] Efficient mutable arrays in STM

Bryan O'Sullivan bos at serpentine.com
Tue Oct 25 22:32:49 CEST 2011

On Tue, Oct 25, 2011 at 1:24 PM, Ketil Malde <ketil at malde.org> wrote:

> You must be a lot more confident than I if you say this without
> benchmarking first. :-) IME, there are (at least) two possible problems
> here, 1) transactions scale (quadratically, I think) with the number of
> TVars touched, so if any transaction touch a large part of the array,
> it's going to cost you, [...]

That woud remain true no matter what, but the current quadratic behaviour is
I believe easily enough fixed by switching to a better data structure than a
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20111025/77b84196/attachment.htm>

More information about the Haskell-Cafe mailing list