tag:blogger.com,1999:blog-16002962.post6191992446581734529..comments2023-10-13T01:00:52.135-07:00Comments on Web Jazz: Algorithm always matters, even when parallelWil Chttp://www.blogger.com/profile/03696320260631888445noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-16002962.post-19330974241535330232008-09-16T10:58:00.000-07:002008-09-16T10:58:00.000-07:00What you've arrived at is one of the canonical exa...What you've arrived at is one of the canonical examples of dynamic programming.<BR/><BR/>As "Anonymous" said, there are reasons they use recursive Fibonacci in places as tests, and none of it has to do with it being the algorithm with least time complexity, since (as you pointed out), it's not. =)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-16002962.post-27955657960301707092008-09-13T00:10:00.000-07:002008-09-13T00:10:00.000-07:00The reason the recursive fib is used as an example...The reason the recursive fib is used as an example is because it's easy to read, easy to write and recurses a whole lot. If you can make recursive fib efficient in a parallel system, you can make pretty much any tree-recursive function efficient. The actual result matters very little, it's all about measuring the overhead.<BR/><BR/>So making an optimized non-recursive version or an optimized non-threading version is completely beside the point, because what you're measuring with fib is the speed of recursion and threading.Anonymousnoreply@blogger.com