The impact of data replication on job scheduling performance in the Data Grid

Tang, Ming; Lee, Bu-Sung; Tang, Xueyan; Yeo, Chai Kiat

doi:10.1016/j.future.2005.08.004

Cited by 138 publications

(96 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The replication strategies can be classified according to whether the strategy is static or dynamic. If resource conditions are relatively stable in the data grid over a long period, the static replication strategy can be applied as it creates and manages the replicas manually [19] (i.e., a replica remains in the system until it is deleted by users or its lifetime has expired [20]). This means that the static replication will not adapt to changing the data access, which is considered an inherent characteristic of the architecture of a data grid when the client changes the access, instead of benefiting the replication strategy.…”

Section: Related Work On Replicationmentioning

confidence: 99%

Dynamic Replication Based on Availability and Popularity in the Presence of Failures

Meroufel¹,

Belalem²

2012

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-The data grid provides geographically distributed resources for large-scale applications. It generates a large set of data. The replication of this data in several sites of the grid is an effective solution for achieving good performance. In this paper we propose an approach of dynamic replication in a hierarchical grid that takes into account crash failures in the system. The replication decision is taken based on two parameters: the availability and popularity of the data. The administrator requires a minimum rate of availability for each piece of data according to its access history in previous periods, but this availability may increase if the demand is high on this data. We also proposed a strategy to keep the desired availability respected even in case of a failure or rarity (nopopularity) of the data. The simulation results show the effectiveness of our replication strategy in terms of response time, the unavailability of requests, and availability

show abstract

Section: Related Work On Replicationmentioning

confidence: 99%

Dynamic Replication Based on Availability and Popularity in the Presence of Failures

Meroufel¹,

Belalem²

2012

Journal of Information Processing Systems

View full text Add to dashboard Cite

show abstract

“…The proposal addresses both scheduling and replication problems. Two replication algorithms Simple Bottom-Up (SBU) and Aggregate Bottom-Up (ABU) for multi-tier data grids are proposed in [39]. These algorithms minimize data access time and network load.…”

Section: Related Workmentioning

confidence: 99%

Self Organized Replica Overlay Scheme for P2P Networks

Bhushan¹,

Dave²,

Patel³

2012

IJCNIS

View full text Add to dashboard Cite

-Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode. P2P systems are suitable for largescale distributed environments in which nodes can share resources other than data such as computing power, memory and network bandwidth. Some of important parameters that affect the performance of P2P systems are peer availability, data availability, network overhead, overlay structure, churn rate, and data access time. In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed. This scheme organizes replicas in a Self Organized Hierarchical Logical Structure (SOHLS) that has special properties. The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums and reducing network overhead. This scheme is highly fault tolerant (tolerate up to 1 n  faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network. The architecture for IHQC is also proposed for implementing the scheme that supports improved performance of P2P systems. This scheme also maximizes the degree of intersection set of read and write quorums; hence, having higher probability to get updated data as compared to all other schemes. The mathematical correctness of the scheme is also presented in the paper. The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.

show abstract

“…In grid environment, replication is one of the major factors affecting performance of Data Grids [3]. With this, it is suggested that well-defined replication strategies will smooth data access, and reduce job execution cost [4]. However, replication isbounded by two factors: the size of storage available at different sites within the Data Grid and the bandwidth between these sites [5].…”

Section: Introductionmentioning

confidence: 99%