"Gabriel Genellina" <gagsl-...@yahoo.com.ar> writes: > Even my Pentium I MMX 233MHz can compute fib(36) thousand of times faster > than that with the right algorithm. So I don't see the point in > parallelizing if you're going to get infinitely worse results...
The point is to test the parallelization scheme. Recursive fibonacci is a standard benchmark for this sort of thing. Sturlamolden's test may be inspired by a recent similar GHC test: http://donsbot.wordpress.com/2007/11/29/ -- http://mail.python.org/mailman/listinfo/python-list
