Journal of Computer Science and Technology

, Volume 29, Issue 2, pp 293–302 | Cite as

SAC: Exploiting Stable Set Model to Enhance CacheFiles

  • Jian-Liang Liu
  • Yong-Le Zhang
  • Lin Yang
  • Ming-Yang Guo
  • Zhen-Jun Liu
  • Lu Xu
Regular Paper
  • 70 Downloads

Abstract

Client cache is an important technology for the optimization of distributed and centralized storage systems. As a representative client cache system, the performance of CacheFiles is limited by transition faults. Furthermore, CacheFiles just supports a simple LRU policy with a tightly-coupled design. To overcome these limitations, we propose to employ Stable Set Model (SSM) to improve CacheFiles and design an enhanced CacheFiles, SAC. SSM assumes that data access can be decomposed to access on some stable sets, in which elements are always repeatedly accessed or not accessed together. Using SSM methods can improve the cache management and reduce the effect of transition faults. We also adopt looselycoupled methods to design prefetch and replacement policies. We implement our scheme on Linux 2.6.32 and measure the execution time of the scheme with various file I/O benchmarks. Experiments show that SAC can significantly improve I/O performance and reduce execution time up to 84%, compared with the existing CacheFiles.

Keywords

Stable Set Model cache management CacheFiles 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2014_1431_MOESM1_ESM.doc (27 kb)
ESM 1 (DOC 27 kb)

References

  1. [1]
    Gulati A, Naik M, Tewari R. Nache: Design and implementation of a caching proxy for NFSv4. In Proc. the 5th USENIX Conf. File and Storage Technologies, Feb. 2007, pp.199-214.Google Scholar
  2. [2]
    Howells D. FS-Cache: A network filesystem caching facility. In Proc. the Linux Symposium, July 2006, pp.424-440.Google Scholar
  3. [3]
    Howard J H, Kazar M L, Menees S G et al. Scale and performance in a distributed file system. ACM Transactions on Computer Systems, 1988, 6(1): 51-81.CrossRefGoogle Scholar
  4. [4]
    Satyanarayanan M, Kistler J J, Kumar P et al. Coda: A highly available file system for a distributed workstation environment. IEEE Trans. Computers, 1990, 39(4): 447-459.CrossRefGoogle Scholar
  5. [5]
    Yang D, Huang H, Zhang J et al. BWFS: A distributed file system with large capacity, high throughput and high scalability. J. Computer Research and Development, 2005, 42(6): 1028-1033. (In Chinese)CrossRefGoogle Scholar
  6. [6]
    Denning P J. Working sets past and present. IEEE Transactions on Software Engineering, 1980, 6(1): 64-84.CrossRefGoogle Scholar
  7. [7]
    Megiddo N, Modha D S. ARC: A self-tuning, low overhead replacement cache. In Proc. the 2nd USENIX Conference on File And Storage Technologies, March 2003, pp.115-130.Google Scholar
  8. [8]
    Johnson T, Shasha D. 2Q: A low overhead high performance buffer management replacement algorithm. In Proc. the 20th Int. Conf. Very Large Data Bases, Sept. 1994, pp.439-450.Google Scholar
  9. [9]
    Jiang S, Zhang X D. LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance. In Proc. the 2002 ACM SIGMETRICS, June 2002, pp.31-42.Google Scholar
  10. [10]
    Guo M Y, Liu L, Zhang Y L et al. Stable set model based methods for large-capacity client cache management. In Proc. the 14th HPCC, June 2012, pp.681-690.Google Scholar
  11. [11]
    Butt A R, Gniady C, Hu Y C.The performance impact of kernel prefetching on buffer cache replacement algorithms. In Proc. ACM SIGMETRICS Int. Conf. Measuring and Modeling of Computer Systems, June 2005, pp.157-168.Google Scholar
  12. [12]
    Sivathanu M, Prabhakaran V, Popovici F I et al. Semantically-smart disk systems. In Proc. the 2nd USENIX Conference on File and Storage Technologies, March 2003, pp.73-88.Google Scholar
  13. [13]
    Traeger A, Zadok E, Joukov N et al. A nine year study of file system and storage benchmarking. ACM Transactions on Storage, 2008, 4(2): Article No.5.Google Scholar
  14. [14]
    Shi L, Liu Z J, Xu L. BWCC: A FS-cache based cooperative caching system for network storage system. In Proc. the 2012 IEEE CLUSTER, September 2012, pp.546-550.Google Scholar
  15. [15]
    Van Hensbergen E, Zhao M. Dynamic policy disk caching for storage networking. Technical Report, RC24123, IBM Research Division Austin Research Laboratory, http://citeseerx.ist.psu.edu/showciting?cid=19808002, Jan. 2014.
  16. [16]
    Kgil T, Mudge T. FlashCache: A NAND flash memory file cache for low power Web servers. In Proc. the 2006 CASES, October 2006, pp.103-112.Google Scholar
  17. [17]
    Ding X N, Jiang S, Chen F et al. DiskSeen: Exploiting disk layout and access history to enhance I/O prefetch. In Proc. USENIX Annual Technical Conference, June 2007, Article No.20.Google Scholar

Copyright information

© Springer Science+Business Media New York & Science Press, China 2014

Authors and Affiliations

  • Jian-Liang Liu
    • 1
    • 2
  • Yong-Le Zhang
    • 3
  • Lin Yang
    • 1
    • 2
  • Ming-Yang Guo
    • 1
  • Zhen-Jun Liu
    • 1
  • Lu Xu
    • 1
  1. 1.Data Storage and Management Technology Research CenterInstitute of Computing Technology, Chinese Academy of SciencesBeijingChina
  2. 2.University of Chinese Academy of SciencesBeijingChina
  3. 3.Department of Electrical and Computer EngineeringUniversity of TorontoTorontoCanada

Personalised recommendations