[Haskell-cafe] Looking for an efficient tree in STM

Einar Karttunen ekarttun at cs.helsinki.fi
Wed Mar 8 06:50:06 EST 2006


Does anyone have an efficient tree implemented in STM that
supports concurrent updates in an efficient fashion? This
seems suprisingly hard to implement - a normal binary
tree with links as TVar is very slow and does not scale
very well.

- Einar Karttunen

More information about the Haskell-Cafe mailing list