Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An LIRS-Based Replica Replacement Strategy for Data-Intensive Applications

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

3 Author(s)
Wei Liu ; Coll. of Comput. Sci. & Technol, Wuhan Univ. of Technol., Wuhan, China ; Feiyan Shi ; Wei Du

Data Replication, creating identical copies of data on different sites geographically, is one of the effective optimization techniques for reducing data access costs and improving load balance among sites in data-intensive computing. However, due to the limitation of storage capacity of each site, an efficient replica replacement can make a significant difference in the performance and efficiency of replication technologies. In this paper, for the inability of LRU to cope with access patterns with weak locality, a novel replacement strategy called Low Inter- reference Recency Set (LIRS) was applied into replica replacement during data replication. And then, OptorSim was extended, and LIRS replica replacement algorithm was implemented. Finally, LIRS replacement strategy was comprehensively compared with other algorithms including LRU, MRU LFU and MFU by use of different scheduling algorithms and file access patterns, and the results show that LIRS replacement algorithm can improve the performance of the data access, especially under access pattern with weak locality.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011