|
|
|
|
|
|
by cepher
1926 days ago
|
|
|
I know that a parallel prefix algorithm [1] can be used to calculate fib(n), since we can use repeated matrix multiplications (a formulation appropriate for a prefix sum algorithm). The computation time can be O(n/p + log p), where p is the number of processors. However, I’m not sure what other approaches there are. [1] https://en.m.wikipedia.org/wiki/Prefix_sum |
|
|