The bottom line first: with a little simple tuning, I was able to improve the performance on my laptop of my benchmark of the 1 to 1,000,000 3n+1 problem.
- For four worker processes:
- from 44 to 27 seconds
- from to 72,026 to 109,311 reads/second
- from to 49,298 to 74,828 updates/second
- For eight worker processes:
- from 248 to 30 seconds
- from 12,782 to 109,285 reads/second
- from 8,750 to 74,802 updates/second
