Rich FitzJohn

Ignore until when (if?) we move to different ODE solver.

This also should ignore mutants.

See #7 for why this matters.

OK, so the benchmark time with the above proxy is 2.2s; I can get that down to 0.78s using Lua scripting. The set of commands doing that are: ``` 1442418968.324859...

Now 0.57s, so a 4x improvement. ``` 1442419683.326714 [0 127.0.0.1:58092] "EVALSHA" "c08d17eabb55a84cf53d22db61bd0cd142d3bf35" "1" "tmpjobs:tasks:counter" 1442419683.326790 [0 lua] "INCR" "KEYS[1]" 1442419683.326807 [0 lua] "TIME" 1442419683.579949 [0 127.0.0.1:58092] "EVALSHA" "1c6c385f068a3488d3035155985563f63faa105d" "6" "tmpjobs:tasks:id"...

For tooling, something like [Haskell's QuickCheck](https://wiki.haskell.org/Introduction_to_QuickCheck1) perhaps? I believe there are a few things that try to do this for R (but not sure if any are on CRAN yet)....

Ah, here's the R quickcheck package I was thinking of: https://github.com/RevolutionAnalytics/quickcheck

If R is the right layer to run this, then I wonder if some of @jeroenooms's OpenCPU things can work here. Otherwise something like Condor sitting in the middle may...

Yeah, that's the one! For the adhoc bits, what you describe sounds a bit like what I have set up previously with [rrqueue](https://github.com/traitecoevo/rrqueue) and am currently working on [queuer](https://github.com/richfitz/queuer). The...

Related: file sync across those nodes is going to be _hard_. This is an issue for any job that depends on data. Spin out into a separate issue?