Yes. This is something I think would be an interesting research project, along with a generalisation of weak refs. It's fairly simple to frame as a reinforcement learning problem. This is some work on this, but I think tech. has moved on in important ways since.
N. On Sun, Oct 17, 2010 at 12:04 PM, Neil Van Dyke <n...@neilvandyke.org> wrote: > Er, and maybe add to that scheduled GC strategy a sense of how worthwhile we > think a GC might be at that time, so that we're not just doing, e.g., a GC 1 > second after each request in a lightly-loaded system, potentially delay > service to the next request when GC wasn't needed. > _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
