node-fib

We can use the technique first described here https://github.com/glenjamin/node-fib by using Fibur.pass. def fib(n) Fibur.pass return n if (0..1).include? n fib(n-1) + fib(n-2) if n > 1 end Now, if you wrap this in Fibur.new, you will get parallel operation!

At your request I'm answering this question... I never used the word "fanboy" in my post. That said, there were two people who really thought the nextTick solution was a legitimately good idea. Contrary to the idea that they were just countertrolling, the Node-fib guy legitimately thought he had done a good implementation of a Fibonacci server in Node because ApacheBench told him so, never mind what he was actually benchmarking was TERRIBLE Read the "Coming from Hacker News?" section of the Node-fib README and tell me if you think this guy is a troll or if he truly believes Node can be good at these sorts of problems: https://github.com/glenjamin/node-fib

https://github.com/glenjamin/node-fib is close enough. Trying to explain how Node can do concurrent Fibonacci without calling another process is falling for the troll's trap - Node isn't "the one true tool", and you don't need to try to prove that it is. The trolls will just say that Fibonacci is too trivial, and you wouldn't use the same approach (co-operative multi-threading) for less trivial CPU-bound tasks. You can use a hammer to bang in screws, but it's not usually the best way. If you are using co-operative multi-threading as a way to get Node to handle concurrent CPU-bound requests, you are Doing It Wrong (TM). In general, it's better to create a second (possibly not async) server to handle CPU intensive stuff, or fork stuff off to a subprocess (depending on the actual task). There might also be other ways - I'm not an expert. I'm

I've just submitted a pull request that I think really enhances this app. https://github.com/glenjamin/node-fib/pull/5/files