ERF: Efficient cache eviction strategy for e-commerce applications

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most vendors of e-commerce applications deploy the cache memory to deliver the web objects to clients faster. However, they face many problems in dealing with the cache memory due to limited resources and dynamic access patterns. As a result, we need to efficiently manage the cache memory by evicting the unused data. The performance of cache manager depends upon the efficiency of delete determination. In this paper, we propose ERF, a cache eviction policy using natural exponential function on time with frequency in order to cope with dynamic nature of e-commerce business with limited memory. It sorts the caches in the order of result value which come from coordination between frequency and recency and evicts the caches according to it. We evaluate the performance of ERF by using the workload which reflects the real-world applications and compare it with conventional algorithms. By increasing the cache hit ratio with ERF, we can expect the decrease of copy and delete operations of cache with improving the overall system performance.

Cite

CITATION STYLE

APA

Lee, J. H., Kwon, S. J., & Chung, T. S. (2018). ERF: Efficient cache eviction strategy for e-commerce applications. In Lecture Notes in Electrical Engineering (Vol. 425, pp. 295–304). Springer Verlag. https://doi.org/10.1007/978-981-10-5281-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free