hey. remember that problem you had with making too many jit specializations?
you've had some counter for each function and it was growing into infinity and with it, the amount of jitted functions
you eventually arrived at some heuristic. it was something like -- every 100k iterations, divide every counter by 2
I'm having a very similar problem in my (completely unrelated) code. I wonder what a good heuristic for decaying counters is in the first place
as sat-solvers have great needs for heuristics, maybe look what they do, what you have now sounds similar to Variable State-Independent Decaying Sum (VSIDS) a heuristic many sat-solvers use, because it is fast to calculate and pretty good for their problem
mattip has quit [Ping timeout: 244 seconds]
mattip has joined #pypy
[Arfrever] has quit [Read error: Connection reset by peer]