A Data Replica Replacement Algorithm Based on Value Model

doi:10.13190/jbupt.200604.41.yanxd

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2006, Vol. 29 ›› Issue (4): 41-44.doi: 10.13190/jbupt.200604.41.yanxd

• Papers • Previous Articles Next Articles

A Data Replica Replacement Algorithm Based on Value Model

YAN Xiao-dong^1,2 , XU Hui-min¹, XU Ya-jing¹, LIOU Lian-xi¹ ，CHEN Bao-feng¹

1. School of Telecommunications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China；2. School of Mathematics and Computer, Central University for Nationalities, Beijing 100081，China

Received:2005-05-12 Revised:1900-01-01 Online:2006-08-30 Published:2006-08-30
Contact: YAN Xiao-dong

Abstract

Abstract:

Adapting to the high variation environment in data grid, a data replica replacement algorithm based on value model is proposed and the arithmetic to calculate replica value is introduced. The algorithm is used on data replica replacement. When there is not enough storage space during replication, the replica whose value is the least will be deleted. This algorithm can improve and maintain a high overall throughput of grid jobs that access files in a data grid. Experimental results show that the proposed algorithm can obtain better performance for grid task to access data replica.

Key words: value model, data grid, data replication, replica replacement

CLC Number:

TP393

YAN Xiao-dong^1,2 , XU Hui-min¹, XU Ya-jing¹, LIOU Lian-xi¹ ，CHEN Bao-feng¹. A Data Replica Replacement Algorithm Based on Value Model[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(4): 41-44.

References

[1] Carman M, Zini F, Serafini L, et al. Towards an economy-based optimization of file access and replication on a data grid//Proceeding of 2nd IEEE/ACM Int Symposium on Cluster Computing and the Grid. Berlin: IEEE, 2002: 340-345.
[2] O'Neil E, O'Neil P, Weikum G. The LRU-K page replacement algorithm for database buffering//Int Conf on Management of Data. Washington: IEEE, 1993: 297-306.
[3] Prischepa V. An efficient Web caching algorithm based on LFU-K replacement policy//Proceedings of the Spring Young Researcher's Collo-Quium on Database and Information Systems. Petersburg: IEEE, 2004: 23-26.
[4] Cao P, Irani S. Cost-aware WWW proxy caching algorithms//USENIX Symposium on Internet Technologies and Systems. California:, 1997: 32-35.
[5] Ekow O, Arie S. Accurate modeling of cache replacement policies in a data grid//Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS 03). Washington: IEEE, 2003: 10.
[6] Ekow O, Olken F, Shoshani A. Disk cache replacement algorithm for storage resource managers in data grids//The 15th Annual Supper Computer Conf. Baltimore: IEEE, 2002: 1-15.
[7] Bell W, Cameron D, Carvajal-Schiaffino R, et al. Eva-luation of an economy-based file replication strategy for a data grid//The International Workshop Agent-Based Cluster and Grid Computing at CCGrid. Tokyo: IEEE, 2003: 661-668.
[8] 闫晓东, 徐惠民. 一种可扩展的分布式副本定位方法[J]. 北京邮电大学学报, 2005, 28(3): 46-48. Yan Xiaodong, Xu Huimin. A scalable, decentralized replica location method[J]. Journal of Beijing University of Posts and Telecommunications, 2005, 28(3):46-48.
[9] 王振凯, 陈建亚, 顾畹仪. 基于层次队列的全光缓存技术[J]. 北京邮电大学学报, 2004, 27(5): 26-30. Wang Zhenkai, Chen Jianya, Gu Wanyi. Hierarchical queuing based optical buffer. Journal of Beijing University of Posts and Telecommunications, 2004, 27(5): 26-30.

A Data Replica Replacement Algorithm Based on Value Model

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 2

Recommended Articles

Metrics

Comments

[1]	YAN Xiaodong,XU Huimin. A Scalable, Decentralized Replica Location Method [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2005, 28(3): 46-48.
[2]	YANG Zheng-qiu. Data Port-a New Schema of Construct of Resource Management System [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2003, 26(S2): 59-63.