Different implementation of the Fibonacci algorithm using parallelism
This is used to benchmark the quality of the parallelism tools in case of recursive parallelism algorithm:
Result of the benchmarks:
- Naive / M*LIB's Worker: 1.11s
- CILK+: 6.33s
- OPENMP: 9.82s