Dynamic Replica Placement and Location Strategies for Data Grid

Gu, Qing; Chen, Bing; Zhang, Yuping

doi:10.1109/csse.2008.1328

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various dynamic replication strategies within a simulated grid environment are discussed in [7] [8] and their combination with scheduling algorithms are studied in [9][10] [14]. Job scheduling and data replication policies for central and tier model organization of data grids have been simulated based on the Grid Datafarm architecture [11].…”

Section: Related Workmentioning

confidence: 99%

JS2DR2: An Effective Two-Level Job Scheduling Algorithm and Two-Phase Dynamic Replication Strategy for Data Grid

Suri

Singh²

2009

2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies

View full text Add to dashboard Cite

Data grid supports a variety of scientific applications that require access to large amount of data with various qualities of service requirements. Ensuring efficient access to such large and widely distributed datasets is hindered by high latencies. Effective scheduling in grid can reduce the amount of data transferred among nodes by dispatching a job to node where most of the required data is available. In addition to efficient scheduling, dynamic replication strategies are regarded as one of the major optimization technique for reducing access latency. In this paper, we propose a two-phase dynamic replication strategy coupled with two-stage job scheduling to provide an integrated environment for efficient access to data and job scheduling. Simulation results demonstrate that 2 2

show abstract