Doing some more performance testing, here's another one that appears to yield good results if someone wants to try it out.

./gapminer-cpu -o 127.0.0.1 -p 31397 -u **** -x **** -t 8 --shift 508 --crt crt/crt-22m-512s.txt --fermat-threads 7 --sieve-primes 10000

It's a very low number of primes to sieve with but results in generating a LOT of candidate gaps in the gaplist.  The gaplist grows by 50000 every 10 seconds.  But the block percentage goes up very quickly.  The reason I think it does is because of j0nn9's algo picking the best candidate gaps from a bigger applicant pool in the heap and thus yielding block solving gaps more quickly.

You'll want to monitor your memory usage for a couple rounds at first, the high watermark for the above arguments on my machine is about 2.6gig of RAM so you'll want to make sure you're not too close to maxing out your memory.