Research on Optimization of Adaptive Cache Replacement Algorithm Strategy
Cache replacement algorithm are a research issue in the fields of e-commerce, short video, edge computing,other highly concurrent systems. The efficiency of cache hits directly impacts the response speed of the system to a certain extent. This article conducts research on classic cache replacement algorithms, including Recently Frequent Access, Least Recently Used, Least Frequently Used Window, Weighted Replacement, Adaptive Cache Replacement, and Window-Based Least Recently Used. Based on the theories of these classic algorithms, this paper proposes an optimization strategy that relies adaptive cache replacement algorithm and a weight replacement algorithm. This article analyzes the similarities and advantages of various algorithms, conducts experiments on cache replacement algorithms using open-source e-commerce datasets, and reports on their performance. Finally, future research directions in this field are discussed.
Authors
- Cheng Yang (ORCID: https://orcid.org/0000-0003-0540-8227)
Institutions
- Wuhan Business University (CN)
Publication Details
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1145/3700906.3700910
- Primary Topic
- Caching and Content Delivery
- Type
- article
- Field-Weighted Citation Impact
- 0.00