![]() from Binet's formula).Īdditionally, recursion, which the OpenMP examples are based on, has much worse performance (several orders of magnitude worse) than calculating the numbers iteratively (this is well known Do iterative and recursive versions of an algorithm have the same time complexity?). I don't understand this as calculating the Fibonacci series is, to my understanding, fundamentally non parallel (ignoring methods based on closed form solutions, e.g. Some of these examples claim the performance is better with OpenMP. There are several examples online which calculate Fibonacci numbers using the task directive in OpenMP. Is there any benefit by using OpenMP to parallelize the Fibonacci number calculations? ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |