Michel Lang
This should do: ```r piApprox = function(n) { nums = matrix(runif(2 * n), ncol = 2) d = sqrt(nums[, 1]^2 + nums[, 2]^2) 4 * mean(d
There is no class `Problem` or `Algorithm` (yet). This is on my todo. In the meantime, you can access everything like this: ```r j = makeJob(1) j$problem j$algorithm j$instance ```...
> I'm not claiming to be an expert in RNGs, but I believe these type of ad hoc set.seed() approaches is not considered correct by those who do know more...
If this is not critical for the JOSS, I'd like to postpone this. Okay with you @HenrikBengtsson ?
As far as I understood it, `nextRNGStream()` should be sufficient for the job seed. If a job needs to start its own parallelization on the slave, it's spawned threads/forks/workers are...
I'm still not convinced that using substreams per default is the right approach. I've looked into the parallel package to find out what `mclapply` does internally: 1. In the first...
Jobs which fail to find a JobCollection file will terminate with an error but appear as "expired" on the master because they were unable to communicate anything back. The log...
Possible that the described mechanism is not sufficient. For some reasons systems are behaving differently than with the result files where a call to `list.files()` is required. Therefore I would...
There is `batchMapResults`. What function are you missing?
Some comments for registries with many jobs: * The file system or network device is usually the bottle neck. Parallelism helps, but don't expect miracles from something like `reduceResultsParallel`, this...