Evaluation of Page Replacement Algorithms in a Geographic Information System.
Daniel Hultgren · 2012
Caching can improve computing performance significantly. In this paper I look at various page replacement algorithms in order to make a cache in two levels -- one in memory and one on a hard drive. Both levels present unique limitations and possibilities: the memory is limited in size but very fast while the hard drive is slow and so large that memory indexing often is not feasible.I also propose several hard drive based algorithms with varying levels of memory consumption and performance, allowing for a trade-off to be made. Further, I propose a variation for existing memory algorithms based on the characteristics of my test data. Finally, I choose the algorithms I consider best for my specific case.