Open Access Research Article

Priority cache object replacement by using LRU, LFU, and FIFO algorithms to improve cache memory hit ratio

Authors

  • Davood Akbari Bengar * Department of Computer Engineering, Savadkooh Branch, Islamic Azad University, Savadkooh, Iran.

https://doi.org/10.22105/metaverse.v2i2.78

Abstract

Due to the increasing CPU and cache memory performance, using replacement algorithms is very important in various aspects of high-performance computing environments such as e-commerce systems, cache memory management in microprocessors, object management in operating systems, iteration strategies in information distribution systems, etc. Database server cache performance is an essential issue in e-commerce systems. Managing the entry and exit of cache objects with replacement algorithms can reduce the workload of the database server and improve server performance. The algorithms determine which objects remain in the cache memory and which go out to make room for new objects. In this way, the algorithms decrease user access time and enhance the system's performance. Most of these algorithms are developed by the famous LRU and LFU schemes and can fix their flaws; however, unlike them, they are challenging to implement. This research proposes a priority object replacement algorithm that is easy to implement. The PCORA algorithm is based on prioritizing cache memory objects according to three parameters. Experiments show that the proposed algorithm has a better hit ratio than others and can improve cache memory performance.         

Keywords

Operating systems Cache memory management E-commerce systems Replacement algorithms Hit ratio Performance
References (43)
  1. [1] Haq, I. U., Khan, S., Khan, M., & Tamsal, S. (2024). Improving security and performance of databases through single cache system. 2024 4th international conference on blockchain technology and information security (ICBCTIS) (pp. 89–95). IEEE. https://doi.org/10.1109/ICBCTIS64495.2024.00022

  2. [2] Hasslinger, G., Okhovatzadeh, M., Ntougias, K., Hasslinger, F., & Hohlfeld, O. (2023). An overview of analysis methods and evaluation results for caching strategies. Computer networks, 228, 109583. https://doi.org/10.1016/j.comnet.2023.109583

  3. [3] Kushwah, J. S., & Tamrakar, S. (2018). An extensive review of webs caching techniques to reduce cache pollution. Imperial journal of interdisciplinary research, 6(13), 87–95. https://rntujournals.aisect.org/assets/upload_files/articles/3b39342f735878fb7ee90c670784dc89.pdf

  4. [4] Zulfa, M. I., Hartanto, R., & Permanasari, A. E. (2020). Caching strategy for Web application-a systematic literature review. International journal of web information systems, 16(5), 545–569. https://doi.org/10.1108/IJWIS-06-2020-0032

  5. [5] Wang, Y., Yang, Y., Han, C., Ye, L., Ke, Y., & Wang, Q. (2019). LR-LRU: A PACS-oriented intelligent cache replacement policy. IEEE access, 7, 58073–58084. https://doi.org/10.1109/ACCESS.2019.2913961

Article Metrics

How to Cite

Akbari Bengar, D. . (2025). Priority cache object replacement by using LRU, LFU, and FIFO algorithms to improve cache memory hit ratio. Metaversalize, 2(2), 94-106. https://doi.org/10.22105/metaverse.v2i2.78

Similar Articles

1-10 of 45

You may also start an advanced similarity search for this article.