PFRF: An adaptive data replication algorithm based on star-topology data grids
- 作者：Ming-Chang Leea ; mingchang1109@gmail.com ; [Author Vitae] ; Fang-Yie Leub ; leufy@thu.edu.tw ; [Author Vitae] ; Ying-ping Chena ; ypchen@nclab.tw ; ypchen@cs.nctu.edu.tw ; [Author Vitae]
- 关键词：Data grid ; Data replication ; Data access patterns ; File popularity ; PFRF
- 刊名：Future Generation Computer Systems
- 出版年：2012
- 期刊代码：54_0167739x
- 类别：cp
- 出版时间：July, 2012
- 卷：28
- 期：7
- 页码：1045-1057
- 文件大小：2461 K
摘要
Recently, data replication algorithms have been widely employed in data grids to replicate frequently accessed data to appropriate sites. The purposes are shortening file transmission distance and delivering files from nearby sites to local sites so as to improve data access performance and reduce bandwidth consumption. Some of the algorithms were designed based on unlimited storage. However, they might not be practical in real-world data grids since currently no system has infinite storage. Others were implemented on limited storage environments, but none of them considers data access patterns which reflect the changes of users鈥?interests, and these are important parameters affecting file retrieval efficiency and bandwidth consumption. In this paper, we propose an adaptive data replication algorithm, called the Popular File Replicate First algorithm (PFRF for short), which is developed on a star-topology data grid with limited storage space based on aggregated information on previous file accesses. The PFRF periodically calculates file access popularity to track the variation of users鈥?access behaviors, and then replicates popular files to appropriate sites to adapt to the variation. We employ several types of file access behaviors, including Zipf-like, geometric, and uniform distributions, to evaluate PFRF. The simulation results show that PFRF can effectively improve average job turnaround time, bandwidth consumption for data delivery, and data availability as compared with those of the tested algorithms.