A Novel Dynamic Greedydual-Size Replacement Strategy to Make Time-Critical Web Applications Successful

Abstract

The GreedyDual-Size (GD-Size) replacement algorithm is a static-cache-size approach that yields a higher hit ratio than the basic LRU replacement algorithm. Yet, maintaining a given hit ratio needs dynamic cache size tuning, and this can only be achieved by the MACSC (model for adaptive cache size control) model so far. Since the GD-Size yields a higher hit ratio than the basic LRU, it is proposed in this paper to replace the LRU unit in MACSC with the GD-Size algorithm. The replacement creates a new and more efficient dynamic cache size tuner, Dynamic GreedyDual-Size (DGD-Size).