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

[wren ng thornton]

On 3/30/12 4:27 AM, Krzysztof Skrzętnicki wrote:
> You mention benchmarking TChans: one particular problem with TChans and
> Chans is that they are unbounded. If the producers outpace consumers it
> soon ends with memory exhaustion.

If that's the case, then you should consider TBChan[1] which is a 
bounded TChan, to solve exactly that problem. (There's also TMChan for 
closeable channels, and TBMChan for bounded closeable channels, as needed.)


[1] http://hackage.haskell.org/package/stm-chans

-- 
Live well,
~wren