[Haskell-cafe] parallelism and state
oleg.grenrus at iki.fi
Fri Jul 14 16:17:28 UTC 2017
I recently made a SplitMix implentation:
When generating `Word64`s it's noticeable faster than `tf-random` (and
`mwc-random` and obviously `random). I didn't benchmark `Double`
generation, as `tf-random` own `Random` class doesn't support it ,
and using `random`'s class would be very unfair.
I haven't announced it (well, mentioned on Twitter), but please give it
On 12.07.2017 04:21, Li-yao Xia wrote:
> 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
>> So I know that if I'm going to run a State computation in several
>> 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
>> in a good way, so any comments are welcome.
>> Haskell-Cafe mailing list
>> To (un)subscribe, modify options or view archives go to:
>> Only members subscribed via the mailman list are allowed to post.
> Haskell-Cafe mailing list
> To (un)subscribe, modify options or view archives go to:
> Only members subscribed via the mailman list are allowed to post.
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 819 bytes
Desc: OpenPGP digital signature
More information about the Haskell-Cafe