next up previous contents
Next: Performance Metrics Up: Cache Replacement Policies Previous: Greedy Dual-Size Algorithm

Performance Comparison

With reference from the paper [3] we can study the performance of the various replacement policies. Using trace driven simulation, we compare the performance of GreedyDual-Size with LRU, Size, Hybrid, and LRV. For LRV, first it is required to go through the whole trace to obtain the necessary parameters, thus giving it the advantage of perfect statistical information. In contrast, GreedyDualSize takes into account cost, size and locality in a more natural manner and does not require tuning to a particular set of traces.



 

Anil Gracias
2001-01-18