Charles Oliver Nutter wrote: > I'm looking for papers, references, descriptions of methodologies for > caching data out of a mutable hierarchy. Anyone got some pointers?
For the moment I've committed code that adds a hash to every node in the tree, and changes higher up cascade down hash changes to descendants. The hash update is done atomically at each level, so I believe threading is not a concern; the worst that could happen is two threads are working with the same type at the same time and one gets a stale entry for a little bit longer. Future calls would see the updated hash and bail out on the cached value. So far the results are good. It slowed down the inline cache slightly (0.32-0.33 up to 0.34-0.35) but sped non-inline-cacheable calls substantially. I need to tidy up some loose ends (like ensuring the method + hash are cached atomically) but it seems to be working well at present. - Charlie --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "JVM Languages" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/jvm-languages?hl=en -~----------~----~----~----~------~----~------~--~---
