Comparison of The Performance of The Replacement Functions for Hard Disk Cache and Web Cache algorithms


Abstract in English

In this research paper, we compare the basic cache algorithms in terms of performance and speed for the purposes of web caching for dynamic content and hard disk buffering purposes, by studying the traditional algorithms in this field, in order to determine the utilization of the basic algorithms in disk storage in the field of web caching. The results shows that algorithms with replacement functions that rely on basic indicators (such as LRU, LFU) give better results in storage for storage purposes in hard drives, while web caching algorithms need additional benchmarks for replacement work to get high performance indicators, Web Cache algorithms also show lower performance then that hard drive, so the need to constantly develop the Web cache algorithm.

References used

K,Arashi, Taha, R Ezaei-H, Achesu P Eyman , G Aderi Leila, Acta Medica, “Designing And Evaluating The Web-Based Information System Of Primary, Health Care In Accordance With The Electronic Health Records Of Iran”, Mediterranea, 2016, 32: 2051
Moruz, Gabriel; Negoescu, Andrei; Neumann, Christian; W, Volker;” Engineering Efficient Paging Algorithms”;Goethe University Frankfurt am Main. Robert-Mayer-Str. 11-15, 60325 Frankfurt am Main, Germany.2015
Saemundsson, Trausti ;”An experimental comparison of cache algorithms”; Research Methodology, Reykjavik University, September 30, 2013

Download