Hm, maybe Fibonacci isn't the best example after all. What we want is likely the following: a simple parallel program that we then run as part of a parallel reduction. I.e. a parallel mapreduce(f, +, ...) where f is also parallelised (and produces uniform workload). However, to be able to use and compare @threads, we need a for-loop kind of parallelization and this is probably non-trivial for Fibonacci (although potentially doable). I think we should just choose any simple and convenient parallel algorithm.
(Maybe a basic parallel matmul could be a choice for f? Or the standard parallel pi computation? I'm not very creative right now 😄)
Originally posted by @carstenbauer in https://github.com/carstenbauer/parallel-julia-zoo/issues/1#issuecomment-1807663161
(cc @Moelf)