The Improved File Caching Mechanism Based on Aging Algorithm

Network File System (NFS) is the most typical distributed file system. With the clients’ access data volume increases, the traditional NFS service structure generates performance bottlenecks. The query volume and data volume substantial increases and make the access speed from the bus and I / O speed changes into a network speed, the access speed is greatly reduced. In order to resolve this problem, we present novel file caching mechanism based on the aging algorithm. Because the aging is a page replacement algorithm, it can not directly use in the file cache. We utilize hash table improving the aging algorithm to make it can be used in the file cache and add the file size factors into the aging algorithm to keep the improved algorithm still is bit operation and the integer comparison. The improved aging algorithm ensures the system’s hit rate and efficiency.

[1]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[2]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[3]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Li Xiao,et al.  DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems , 2006, IEEE Transactions on Parallel and Distributed Systems.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  P. Kidwell,et al.  The mythical man-month: Essays on software engineering , 1996, IEEE Annals of the History of Computing.

[7]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[8]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[9]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[10]  Fabrizio Valpreda.  Open Software Foundation , 2012 .

[11]  Y. Charlie Hu,et al.  Transparent query caching in peer-to-peer overlay networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.