PHFS: A dynamic replication method, to decrease access latency in the multi-tier data grid

Khanli, Leyli Mohammad; Isazadeh, Ayaz; Shishavan, Tahmuras N.

doi:10.1016/j.future.2010.08.013

Cited by 61 publications

(31 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Khanli et al [27] mention that most of the recent work on data replication focus on temporal and geographical locality, but not on spatial (file) locality. They propose Predictive Hierarchical Fast Spread (PHFS) as an improvement over Fast Spread.…”

Section: Dynamic Replication Strategies For Multi-tier Architecturementioning

confidence: 99%

Dynamic replication strategies in data grid systems: a survey

et al. 2015

View full text Add to dashboard Cite

In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out. B Uras Tos

show abstract

Section: Dynamic Replication Strategies For Multi-tier Architecturementioning

confidence: 99%

Dynamic replication strategies in data grid systems: a survey

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Ruay-Shiung Chang and Hui-Ping Chang presented Latest Access Largest Weight (LALW) dynamic replication strategies [5,6]. LALW utilizes the half-life concept to evaluate file weights.…”

Section: Related Workmentioning

confidence: 99%

Based on the Correlation of the File Dynamic Replication Strategy in Multi-Tier Data Grid

Zhong-qiang¹,

Zuo²,

Zhang³

2015

IJDTA

View full text Add to dashboard Cite

show abstract

“…The simulation results show that the best strategy has significant savings in latency and bandwidth consumption if the access patterns contain a moderate amount of geographical locality. In [2], Khanli et al proposed PHFS (predictive hierarchal fast spread), which is a replication technique designed to decrease the access latency of data access. This is an extension of fast spread presented by Ranganathan et al [14].…”

Section: Related Workmentioning

confidence: 99%

“…As a specialization and extension of the Grid [1], the Data Grid is a solution for this problem [2]. A data grid connects a collection of hundreds of geographically distributed computers and storage resources located in different parts of the world to facilitate sharing of data and resources [3], [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A four-phase data replication algorithm for data grid

Saleh¹,

Javidan

FatehiKhajeh³

2015

JACST

View full text Add to dashboard Cite

Nowadays, scientific applications generate a huge amount of data in terabytes or petabytes. Data grids currently proposed solutions to large scale data management problems including efficient file transfer and replication. Data is typically replicated in a Data Grid to improve the job response time and data availability. A reasonable number and right locations for replicas has become a challenge in the Data Grid. In this paper, a four-phase dynamic data replication algorithm based on Temporal and Geographical locality is proposed. It includes: 1) evaluating and identifying the popular data and triggering a replication operation when the popularity data passes a dynamic threshold; 2) analyzing and modeling the relationship between system availability and the number of replicas, and calculating a suitable number of new replicas; 3) evaluating and identifying the popular data in each site, and placing replicas among them; 4) removing files with least cost of average access time when encountering insufficient space for replication. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid Projects. The simulation results show that the proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage and percentage of storage filled.

show abstract

PHFS: A dynamic replication method, to decrease access latency in the multi-tier data grid

Cited by 61 publications

References 17 publications

Dynamic replication strategies in data grid systems: a survey

Dynamic replication strategies in data grid systems: a survey

Based on the Correlation of the File Dynamic Replication Strategy in Multi-Tier Data Grid

A four-phase data replication algorithm for data grid

Contact Info

Product

Resources

About