Elaborating a bit, the 2 main additional costs of a bounded cache compared to an unbounded one are:
1. The extra cost of managing the LRU machinery (fastcache alleviates this by doing all the necessary management at the C level) 2. The cost of repeated cache misses because the cache size is not appropriate for a particular problem. Problem 2 is much harder to quantify and solve efficiently and could easily be the cause of the significant slowdown on some tests. We could just make the cache bigger... On Monday, July 20, 2015 at 10:30:11 AM UTC-6, Peter Brady wrote: > > We visited the jacobian issue a while ago and I think the takeaway was > that a larger cache size (about 2-3000) sped things up considerably. Not > sure if this is the same issue though. > > On Monday, July 20, 2015 at 10:25:24 AM UTC-6, Ondřej Čertík wrote: >> >> On Mon, Jul 20, 2015 at 1:02 AM, Jason Moore <moore...@gmail.com> wrote: >> > Yes, it seems that the new cache commit is the slow down in these >> tests. >> >> If this is the case, then I know that Peter Brady who wrote it will be >> interested in this. We should get to the bottom of the issue. >> >> Ondrej >> > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/a2484c2c-a031-46f9-8dc9-827efbc48927%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
