Hi all, I'm a student working on improving the CacheManager in Derby as part of Google's Summer of Code. Over the summer, I have looked at two ways of improving it. In my first approach, I implemented the ClockPro algorithm. In my second approach, I tried to separate the cache implementation from the replacement policy using the PluggableCache architecture. This allows for many policies to be "plugged" in.
I wrote a small report summarizing my summer work including some early results. I'm planning to port some benchmarks and evaluate the design further. I'll let you know of my progress. I appreciate everyone's help over the summer and would like your comments on my report and my design choices. I have placed the code and report on my website at: Report http://www.eecg.toronto.edu/~gokul/derby/derby-report-aug-19-2006.pdf Code http://www.eecg.toronto.edu/~gokul/derby/code/aug-19-2006/ Thanks, Gokul
