[Haskell-cafe] Re: Benchmarking and Garbage Collection

2010-03-31 Thread Simon Marlow
On 04/03/2010 22:01, Neil Brown wrote: Jesper Louis Andersen wrote: On Thu, Mar 4, 2010 at 8:35 PM, Neil Brown nc...@kent.ac.uk wrote: CML is indeed the library that has the most markedly different behaviour. In Haskell, the CML package manages to produce timings like this for fairly simple

[Haskell-cafe] Re: Benchmarking and Garbage Collection

2010-03-05 Thread Neil Brown
Simon Marlow wrote: import Control.Concurrent import Control.Concurrent.CML import Control.Monad main :: IO () main = do let numChoices = 2 cs - replicateM numChoices channel mapM_ forkIO [replicateM_ (10 `div` numChoices) $ sync $ transmit c () | c - cs] replicateM_ 10 $ sync $

[Haskell-cafe] Re: Benchmarking and Garbage Collection

2010-03-05 Thread Simon Marlow
On 05/03/2010 13:45, Neil Brown wrote: Simon Marlow wrote: import Control.Concurrent import Control.Concurrent.CML import Control.Monad main :: IO () main = do let numChoices = 2 cs - replicateM numChoices channel mapM_ forkIO [replicateM_ (10 `div` numChoices) $ sync $ transmit c () | c -