[pypy-issue] [issue1345] Improve warmup time of recursive calls [ Pypy slow in recursion ]

[Fijal]

Fijal <fijall at gmail.com> added the comment:

Note that you're messing up two issues here. Large fibonaccis are using longs 
and have a completely different hotspot. What you should do to measure small 
numbers would be to compute f(10) about 500 times or so. (increase as necessary) 
and see how that behaves.

It's also worth noting that while super famous, the recursive fibonacci is a 
really bad benchmark. It's also known to particularly suck on PyPy for obscure 
reasons (which don't apply to more complicated recursion in the same extend). 
That said, the warmup time can definitely be improved in general.

----------
nosy: +fijal
status: unread -> chatting

________________________________________
PyPy bug tracker <tracker at bugs.pypy.org>
<https://bugs.pypy.org/issue1345>
________________________________________