System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nagasako, Y. ; Grad. Sch., Kogakuin Univ., Tokyo, Japan ; Yamaguchi, S.

Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.

Published in:

Autonomous Decentralized Systems (ISADS), 2011 10th International Symposium on

Date of Conference:

23-27 March 2011