Random Processes: Filtering, Estimation, and Detection
Random Processes: Filtering, Estimation, and Detection
Identifying Dynamic Replication Strategies for a High-Performance Data Grid
GRID '01 Proceedings of the Second International Workshop on Grid Computing
Simulation of Dynamic Data Replication Strategies in Data Grids
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
A Prediction-Based and Cost-Based Replica Replacement Algorithm Research and Simulation
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Grid supporting platform for AMS data processing
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
Data Grid is a new kind of data management infrastructure. To improve access efficiency, large amounts of data on Data Grids need to be replicated in the form of replicas at distributed sites. Due to the limited storage capacity, a good replica replacement algorithm is needed. This paper proposes a replica replacement algorithm based on value-cost prediction, which achieves a good balance between value and cost. The algorithm predicts replica value to select replicas that will be replaced in the first stage, and predicts the bandwidth to make replacement cost as low as possible in the second stage. Simulation shows that compared with traditional replacement algorithms our replica replacement algorithm contributes to better grid performance.