A Prediction-based Two-Stage Replica Replacement Algorithm
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 594-598
Abstract
To access large and widely distributed data on data grid quickly and efficiently is an important goal of the implementation of data grid. Due to high latency of the Internet, large amounts of data need to be replicated in multiple copies at several distributed sites. However, the storage capacity is limited. So a good replacement algorithm is important to the efficiency of the access to the replicas. In this paper, we propose a prediction-based two-stage replica replacement algorithm. This algorithm achieves a good balance between value and cost by predicting replica value to make sure which replica will be replaced, and predicting the replacement cost to make it as low as possible. Simulation results show that compared with traditional replacement algorithms our prediction-based two-stage replica replacement algorithm shows better performance and efficiency of the data access on data grids.Keywords
This publication has 8 references indexed in Scilit:
- A Prediction-Based and Cost-Based Replica Replacement Algorithm Research and Simulation2005
- Grid Supporting Platform for AMS Data Processing2005
- Replica Management in the European DataGrid ProjectJournal of Grid Computing, 2004
- Optorsim: A Grid Simulator for Studying Dynamic Data Replication StrategiesThe International Journal of High Performance Computing Applications, 2003
- Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid2003
- A decentralized architecture for adaptive media dissemination2003
- Random Processes2003
- The data grid: Towards an architecture for the distributed management and analysis of large scientific datasetsJournal of Network and Computer Applications, 2000