Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Replica Placement Design with Static Optimality and Dynamic Maintainability
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Study of Different Replica Placement and Maintenance Strategies in Data Grid
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
| Hi-index | 0.00 |
One of the challenges for data replication in a Data Grid is to select the candidate sites that will host the replicas of datasets. In our earlier research (Rahman et al., 2006, May; Rahman et al., 2007, May), we propose different replica placement algorithms based on three mathematical models, i.e. p-centre, p-median and a multi-objective models. We also present a replica maintenance algorithm to relocate replicas to different sites if the performance of the replica host sites degrades significantly. In this research, we validate our replica placement algorithms with different performance metrics, e.g. total file transfer time, the number of local and remote file access, with accuracy. To evaluate our replica placement algorithms, we use a Data Grid simulator called OptorSim (Bell et al., 2003). This paper presents detailed execution flows of the replication algorithms in the simulator. The study of our replica placement algorithms is carried out using a model of the EU Data Grid Testbed 1 (Bell et al., 2003) sites and the associated network geometry. Jobs are based on the CDF use-case as described in Huffman et al. (2002).