Complete and fragmented replica selection and retrieval in Data Grids

Rather than replicating a file completely, Chang et al. proposed a fragmented replication technique to cope with the problem that only partial content of the replica are required in a local application. Furthermore, they also proposed two server selection algorithms for replica retrieval. However, their algorithms do not always find an optimal solution. To address the problem, in this paper, the authors propose a replica selection algorithm to improve the fragmented replica retrieval efficiency in this paper. It is a heuristic considering not only the transmission time but also the number of available servers for each block. Simulation results show that the proposed algorithm can improve the retrieval efficiency up to 12%.

Download Full-text

Replica Selection in Data Grids Using Preconditioning of Decision Attributes by K-means Clustering (K-RSDG)

2010 Second Vaagdevi International Conference on Information Technology for Real World Problems ◽

10.1109/vcon.2010.11 ◽

2010 ◽

Cited By ~ 6

Author(s):

Rafah M. Almuttairi ◽

Rajeev Wankar ◽

Atul Negi ◽

C.R. Rao

Keyword(s):

Data Grids ◽

Decision Attributes ◽

Replica Selection

Download Full-text

Response Time Optimization for Replica Selection Service in Data Grids

Journal of Computer Science ◽

10.3844/jcssp.2008.487.493 ◽

2008 ◽

Vol 4 (6) ◽

pp. 487-493 ◽

Cited By ~ 7

Author(s):

Husni Hamad E. AL-Mistari ◽

Chan Huah Yong

Keyword(s):

Response Time ◽

Data Grids ◽

Time Optimization ◽

Replica Selection

Download Full-text

New Replica Selection Technique for Binding Replica Sites in Data Grids

Iraqi Journal for Electrical And Electronic Engineering ◽

10.37917/ijeee.6.2.16 ◽

2010 ◽

Vol 6 (2) ◽

pp. 186-193

Author(s):

Rafah Almuttairi ◽

Rajeev Wankar ◽

Atul Negi ◽

C. R. Rao. ◽

Mahdi Almahna

Keyword(s):

Response Time ◽

Execution Time ◽

Selection Strategy ◽

Data Grids ◽

Network Resources ◽

Total Execution Time ◽

Transfer Rates ◽

Selection Technique ◽

Replica Selection ◽

Improved Performance

The objective in Data Grids is to reduce access and file (replica) transfer latencies, as well as to avoid single site congestion by the numerous requesters. To facilitate access and transfer of the data, the files of the Data Grid are distributed across the multiple sites. The effectiveness of a replica selection strategy in data grids depends on its ability to serve the requirement posed by the users' jobs. Most jobs are required to be executed at a specific execution time. To achieve the QoS perceived by the users, response time metrics should take into account a replica selection strategy. Total execution time needs to factor latencies due to network transfer rates and latencies due to search and location. Network resources affect the speed of moving the required data and searching methods can reduce scope for replica selection. This paper presents a replica selection strategy that adapts its criteria dynamically so as to best approximate application providers’ and clients’ requirements. We introduce a new selection technique (EST) that shows improved performance over the more common algorithms.

Download Full-text