Weighted Cache Replace Algorithm for Storage System

DOI

10.2991/iske.2007.8How to use a DOI?

Keywords

Cache replace algorithm, average access time, algorithm overhead, weighted value

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. After 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.

Copyright

© 2007, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yihui Luo
AU  - Xie Changsheng
AU  - Zhang Chengfeng
PY  - 2007/10
DA  - 2007/10
TI  - Weighted Cache Replace Algorithm for Storage System
BT  - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007)
PB  - Atlantis Press
SP  - 38
EP  - 44
SN  - 1951-6851
UR  - https://doi.org/10.2991/iske.2007.8
DO  - 10.2991/iske.2007.8
ID  - Luo2007/10
ER  -