Cache Memory: An Analysis on Replacement Algorithms and Optimization Techniques

  • Qaisar Javaid Department of Computer Science & Software Engineering, International Islamic University, Islamabad.
  • Ayesha Zafar
  • Muhammad Awais
  • Munam Ali Shah

Abstract

Caching strategies can improve the overall performance of a system by allowing the fast processor and slow memory to at a same pace. One important factor in caching is the replacement policy. Advancement in technology results in evolution of a huge number of techniques and algorithms implemented to improve cache performance. In this paper, analysis is done on different cache optimization techniques as well as
replacement algorithms. Furthermore this paper presents a comprehensive statistical comparison of cache optimization techniques.To the best of our knowledge there is no numerical measure which can tell us the rating of specific cache optimization technique. We tried to come up with such a numerical figure. By statistical comparison we find out which technique is more consistent among all others. For said purpose we calculated mean and CV (Coefficient of Variation). CV tells us about which technique is more consistent. Comparative analysis of different techniques shows that victim cache has more consistent technique among all.

Published
Oct 1, 2017
How to Cite
JAVAID, Qaisar et al. Cache Memory: An Analysis on Replacement Algorithms and Optimization Techniques. Mehran University Research Journal of Engineering & Technology, [S.l.], v. 36, n. 4, p. 10, oct. 2017. ISSN 2413-7219. Available at: <http://publications.muet.edu.pk/index.php/muetrj/article/view/27>. Date accessed: 17 dec. 2017.