›› 2014, Vol. 29 ›› Issue (2): 293-302.doi: 10.1007/s11390-014-1431-z

Special Issue: Computer Architecture and Systems

• Special Section on Cloud-Sea Computing Systems • Previous Articles     Next Articles

SAC:Exploiting Stable Set Model to Enhance CacheFiles

Jian-Liang Liu1, 2 (刘建亮), Yong-Le Zhang3 (张永乐), Lin Yang1, 2 (杨琳), Ming-Yang Guo1 (郭明阳) Zhen-Jun Liu1 (刘振军), and Lu Xu1 (许鲁)   

  1. 1 Data Storage and Management Technology Research Center, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;
    2 University of Chinese Academy of Sciences, Beijing 100049, China;
    3 Department of Electrical and Computer Engineering, University of Toronto, Toronto M5S 3G4, Canada
  • Received:2013-11-15 Revised:2014-01-08 Online:2014-03-05 Published:2014-03-05
  • About author:Jian-Liang Liu received his M.S degree in computer science from China University of Geoscience, Beijing, in 2010. Now, he is currently a Ph.D. candidate of Institute of Computing Technology (ICT), Chinese Academy of Sciences (CAS), Beijing. His research interests include blocklevel storage and cache management.
  • Supported by:

    This work was supported by the National Basic Research 973 Program of China under Grant No. 2011CB302304, the National High Technology Research and Development 863 Program of China under Grant Nos. 2011AA01A102, 2013AA013201 and 2013AA013205, the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No. XDA06010401, and the Chinese Academy of Sciences Key Deployment project under Grant No. KGZD-EW-103-5(7).

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 loosely-coupled 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.

[1] Gulati A, Naik M, Tewari R. Nache: Design and implementa-tion of a caching proxy for NFSv4. In Proc. the 5th USENIX Conf. File and Storage Technologies, Feb. 2007, pp.199-214.

[2] Howells D. FS-Cache: A network filesystem caching facility. In Proc. the Linux Symposium, July 2006, pp.424-440.

[3] Howard J H, Kazar M L, Menees S G et al. Scale and per-formance in a distributed file system. ACM Transactions on Computer Systems, 1988, 6(1): 51-81.

[4] Satyanarayanan M, Kistler J J, Kumar P et al. Coda: A highly available file system for a distributed workstation en-vironment. IEEE Trans. Computers, 1990, 39(4): 447-459.

[5] Yang D, Huang H, Zhang J et al. BWFS: A distributed file system with large capacity, high throughput and high scala-bility. J. Computer Research and Development, 2005, 42(6): 1028-1033. (In Chinese)

[6] Denning P J. Working sets past and present. IEEE Transac-tions on Software Engineering, 1980, 6(1): 64-84.

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

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

[9] Jiang S, Zhang X D. LIRS: An effcient low inter-reference recency set replacement policy to improve buffer cache per-formance. In Proc. the 2002 ACM SIGMETRICS, June 2002, pp.31-42.

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

[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 Mod-eling of Computer Systems, June 2005, pp.157-168.

[12] Sivathanu M, Prabhakaran V, Popovici F I et al. Semanti-cally-smart disk systems. In Proc. the 2nd USENIX Confer-ence on File and Storage Technologies, March 2003, pp.73-88.

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

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

[15] Van Hensbergen E, Zhao M. Dynamic policy disk caching for storage networking. Technical Report, RC24123, IBM Research Division Austin Research Laboratory, http://cite-seerx.ist.psu.edu/showciting?cid=19808002, Jan. 2014.

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

[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.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Zhang Bo; Zhang Ling;. Statistical Heuristic Search[J]. , 1987, 2(1): 1 -11 .
[2] Meng Liming; Xu Xiaofei; Chang Huiyou; Chen Guangxi; Hu Mingzeng; Li Sheng;. A Tree-Structured Database Machine for Large Relational Database Systems[J]. , 1987, 2(4): 265 -275 .
[3] Lin Qi; Xia Peisu;. The Design and Implementation of a Very Fast Experimental Pipelining Computer[J]. , 1988, 3(1): 1 -6 .
[4] Sun Chengzheng; Tzu Yungui;. A New Method for Describing the AND-OR-Parallel Execution of Logic Programs[J]. , 1988, 3(2): 102 -112 .
[5] Zhang Bo; Zhang Tian; Zhang Jianwei; Zhang Ling;. Motion Planning for Robots with Topological Dimension Reduction Method[J]. , 1990, 5(1): 1 -16 .
[6] Wang Dingxing; Zheng Weimin; Du Xiaoli; Guo Yike;. On the Execution Mechanisms of Parallel Graph Reduction[J]. , 1990, 5(4): 333 -346 .
[7] Zhou Quan; Wei Daozheng;. A Complete Critical Path Algorithm for Test Generation of Combinational Circuits[J]. , 1991, 6(1): 74 -82 .
[8] Zhao Jinghai; Liu Shenquan;. An Environment for Rapid Prototyping of Interactive Systems[J]. , 1991, 6(2): 135 -144 .
[9] Shang Lujun; Xu Lihui;. Notes on the Design of an Integrated Object-Oriented DBMS Family[J]. , 1991, 6(4): 389 -394 .
[10] Xu Jianguo; Gou Yuchai; Lin Zongkai;. HEPAPS:A PCB Automatic Placement System[J]. , 1992, 7(1): 39 -46 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved