Cart (Loading....) | Create Account
Close category search window
 

2C: A New Approach to Design the Second Level Buffer Cache

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)
Yingjie Zhao ; Dept. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha ; Nong Xiao

Multi-level cache hierarchies are very common in today's networked storage environments. Dedicated data servers or file servers are simultaneously accessed by multi-applications of multi-clients. Workload shift results in cache pollution and degrade of hit ratio. Widely used cache policies work well on the case when a single level cache separates the data provider and data consumer, but poorly on the second level buffer cache scenarios. To avoid the threshing induced by improper cache policies, Lustre file system even abandons the idea of employing server-side buffer caches. However, it suffers from poor performance on random access. We propose a novel cache replacement policy 2C, namely the 2nd level Cache replacement policy, which provides fast access to random pages without extra degrade of hit ratio. 2C detects sequential pages and reclaims memory for random access, so hit ratio of random access is increased significantly. Because 2C reduces the overhead of seeking and rotating time mainly induced by disk head movements of random access, it improves the effective access time of overall storage systems. Our simulation results show that 2C performs better than LRU for a wide range of cache sizes and random/sequential workloads.

Published in:

Grid and Cooperative Computing, 2008. GCC '08. Seventh International Conference on

Date of Conference:

24-26 Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.