A concurrent, lock-free, ordered set data type based on skip lists (which in
turn utilise atomicModifyIORef).
Passes all QuickCheck test cases. Below are some performance measurements
against Data.Set. p is the number of hardware threads passed to +RTS -N;
t is the median time in seconds of executing each operation 100 times. These
graphs were generated with graph-summary.py.
Assuming you have GHC already installed:
$ cabal configure --enable-tests
$ cabal build
$ cabal test
$ cabal install
import Data.Concurrent.OrderedSet
main = do
oset <- fromList [1..3]
delete 2 oset
result <- toList oset
putStrLn $ show resultBSD3
- Multicore Programming in Haskell
- Herlihy, Shavit: The Art of Multiprocessor Programming