A Weight-Based Dynamic Replica Replacement Strategy in Data Grids
Authors:
- Wuqing ZhaoWZWuqing Zhao
- Xianbin XuXXXianbin Xu
- Naixue XiongNXNaixue Xiong
- Zhuowei WangZWZhuowei Wang
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1544-1549
Abstract
Data grid is a very important and useful technique to process the large number of data produced by scientific experiments and simulations. However, the high latency of the Internet turns to be the bottleneck in accessing the files in the grid. The replication strategy can shorten the time of getting the files by creating many replicas and storing the replicas in appropriate locations. Restricted by the storage capacity, it is important to design an effective algorithm for the replication replacement task. In this paper, we propose a novel replacement strategy which calculates the weight of replicas based on the access times in the future time window, the access bandwidth and the file size. Results from the simulation procedure show the better performance of our algorithm than former ones.Keywords
This publication has 12 references indexed in Scilit:
- A Prediction-based Two-Stage Replica Replacement Algorithm2007
- A VO-Based Two-Stage Replica Replacement Algorithm2007
- Utility-Based Replication Strategies in Data Grids2006
- A Prediction-Based and Cost-Based Replica Replacement Algorithm Research and Simulation2005
- Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid2003
- A decentralized architecture for adaptive media dissemination2003
- Opportunity cost algorithms for reduction of I/O and interprocess communication overhead in a computing clusterIEEE Transactions on Parallel and Distributed Systems, 2003
- Identifying Dynamic Replication Strategies for a High-Performance Data Grid2001
- Data Management in an International Data Grid Project2000
- The LRU-K page replacement algorithm for database disk buffering1993