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

  • Authors:
  • Leyli Mohammad Khanli;Ayaz Isazadeh;Tahmuras N. Shishavan

  • Affiliations:
  • Cs Department, University of Tabriz, Tabriz, Iran;Cs Department, University of Tabriz, Tabriz, Iran;University of Tabriz, Tabriz, Iran

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data replication is a method to improve the performance of data access in distributed systems. Dynamic replication is a kind of replication that adapts replication configuration with the change of users' behavior during the time to ensure the benefits of replication. In this paper, we propose a new dynamic replication method in a multi-tier data grid called predictive hierarchical fast spread (PHFS) which is an extended version of fast spread (a dynamic replication method in the data grid). Considering spatial locality, PHFS tries to predict future needs and pre-replicates them in hierarchal manner to increase locality in accesses and consequently improves performance. In this paper, we compare PHFS and CFS (common fast spread) with an example from the perspective of access latency. The results show that PHFS causes lower latency and better performance in comparison with CFS.