I’ve uploaded optimized upgraded versions of my SoZ prime generators,
with included benchmarks against the Sieve of Atkin (SoA) and Sieve of
Eratosthenes (SoE). Available here:
Versions for Python and Forth also provided here too.
I am also finishing a paper presenting a mathematical/algorithmic
analysis and explanation of my method. This will explain why the SoZ
generators are computationally superior than the SoA and SoE.
An interesting result is the benchmarks under Ruby 1.9.0-1 are many
times faster than under “normal” Python, and even close compared to
Python using the psyco C optimizing library.
I’ve tried to run my Ruby code with JRuby, but I can’t get JRuby to
install correctly on my laptop (w/PCLinuxOS, Intel P4 2.8Ghz).
I would appreciate if someone would run my code under JRuby, Rubinius,
et al, and post results.