Year: 2007
Type: conference-paper
Abstract: Usual cache replace algorithms are based on the assumption that the high cache hit ratio can bring lower average access time, which is right as storage system has the same device access time.By analyzing the performance of storage system, a conclusion is drawn that storage system can get lower average access time only when the cache hit ratios of some objects with long device access time are higher.Based on this, some weighting cache replace algorithms such as Weighting LFU (WLFU), Weighting LRU (WLRU) and Weighting LFRU (WLFRU) are proposed.These algorithms are designed to minimize average access time and algorithm overhead.Experiment proved that WLFU and WLRU had better performance than usual algorithms such as LRU, and WLFRU had the best performance.
DOI: 10.2991/iske.2007.8
Authors: Yihui Luo, Xie Changsheng, Zhang Chengfeng
Language: English
Topic: Caching and Content Delivery
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W1990488199
