[Haskell-cafe] parallelism and state

Li-yao Xia lysxia at gmail.com
Wed Jul 12 01:21:24 UTC 2017

For a splittable PRNG, check out tf-random.


On 07/11/2017 09:11 PM, Dennis Raddle wrote:
> I'm trying to parallelize a Monte Carlo backtracking search algorithm. The
> trick is that my algorithm is expressed in a State monad, because I need to
> hold a StdGen as well as keep several records of computations and metrics.
> So I know that if I'm going to run a State computation in several parallel
> lines of execution, I need to conceive of a way to split the state and
> later recombine it.
> Here is a simple example I came up with. I have no idea if I'm doing this
> in a good way, so any comments are welcome.
> http://lpaste.net/356879
> D
> _______________________________________________
> Haskell-Cafe mailing list
> To (un)subscribe, modify options or view archives go to:
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
> Only members subscribed via the mailman list are allowed to post.

More information about the Haskell-Cafe mailing list