Abstract: Cache replacement policies are developed to help insure optimal use of limited resources. Varieties of such algorithms exist with relatively few that dynamically adapt to traffic patterns. Algorithms that are tunable typically utilize off-line training mechanisms or trial-and-error to determine optimal characteristics. Utilizing multiple algorithms to establish an efficient replacement policy that dynamically adapts to changes in traffic load and access patterns is a novel option that is introduced in this article. A simulation of this approach utilizing two existing, simple, and effective policies; namely, LRU and LFU was studied to assess the potential of the adaptive policy. This policy is compared and contrasted to other cache replacement policies utilizing public traffic samples mentioned in the literature as well as a synthetic model created from existing samples. Simulation results suggest that the adaptive cache replacement policy is beneficial, primarily in smaller cache sizes.

Sherif Elfayoumy and Sean Warden, “Adaptive Cache Replacement:A Novel Approach” International Journal of Advanced Computer Science and Applications(IJACSA), 5(7), 2014. http://dx.doi.org/10.14569/IJACSA.2014.050716

@article{Elfayoumy2014,
title = {Adaptive Cache Replacement:A Novel Approach},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2014.050716},
url = {http://dx.doi.org/10.14569/IJACSA.2014.050716},
year = {2014},
publisher = {The Science and Information Organization},
volume = {5},
number = {7},
author = {Sherif Elfayoumy and Sean Warden}
}