A novel taxonomy of replica selection techniques is proposed. We studied some data grid approaches where the selection strategies of data management is different. The aim of the study is to determine the common concepts and observe their performance and to compare their performance with our strategy.

A data grid functions as a scalable base for grid services to manage data files and their scattered replicas around the world. The principal objective of grid services is to support various data grid applications (jobs) as well as projects. Replica selection is an essential high-level service that selects a Grid location which verifies the shortest response time for the users' jobs among numero...

Replication is a useful technique for distributed database systems and has been implemented in EU data grid and HEP in CERN for handling huge data access. Replica selection in their prototypes still can be enhanced to provide high availability, fault tolerant and low in communication cost. This paper introduces a new replica control protocol, named Diagonal Replication in 2D Mesh (DR2M) for gri...

In an increasing number of scientiic disciplines, large data collections are emerging as important community resources. In this paper, we introduce design principles for a data management architecture called the Data Grid. We describe two basic services that we believe are fundamental to the design of a data grid, namely, storage systems and metadata management. Next, we explain how these servi...

In an increasing number of scienti c disciplines, large data collections are emerging as important community resources. In this paper, we introduce design principles for a data management architecture called the Data Grid. We describe two basic services that we believe are fundamental to the design of a data grid, namely, storage systems and metadata management. Next, we explain how these servi...

Achieving predictable performance is critical for many distributed applications, yet difficult to achieve due to many factors that skew the tail of the latency distribution even in well-provisioned systems. In this paper, we present the fundamental challenges involved in designing a replica selection scheme that is robust in the face of performance fluctuations across servers. We illustrate the...

The restriction deficient mutant 8195 of Acholeplasma laidlawii strain JA1 was transformed by the promiscuous streptococcal plasmid vector pNZ18 at a frequency of 4 x 10(-4)/cfu. The plasmid was maintained without structural rearrangements but was lost in the absence of a selection pressure, i.e. kanamycin or neomycin. Transformed primary colonies were easily recognized due to a different colon...

Executing walks in partitioned, distributed graphs with minimal latency requires reducing the number of network hops taken. This is especially important for graph databases that specialize on executing fast graph traversals. We present fast-forward-search, an algorithm that uses overlapping graph partitionings, i.e. replication, and parallel speculative execution to minimize the number of requi...