A data replica replacement algorithm based on value model in mobile grid environments

One of the major problems in mobile grid environments is the optimal distribution and replication of data files, in order to improve and maintain a high overall throughput of grid jobs that access files. A data replica replacement algorithm based on value model is proposed and the arithmetic method to calculate replica value is introduced. This algorithm adapts to the high variation environment in mobile grid environment. The value of a data replica reflects the usage history of the cache and the variability of it. We construct a data replica value evaluation system which makes those unstable or rarely used replicas first be deleted, when there is not enough storage space during replication. We also do some analysis and experiments on the algorithm. From analysis we can find that after we use value model, the whole grid system's data replica use probability is more increased. Experimental results also show that the proposed algorithm can obtain better performance for grid tasks to access data replicas and it is feasible and effective

[1]  V Prischepa Vladimir.  AN EFFICIENT WEB CACHING ALGORITHM BASED ON LFU-K REPLACEMENT POLICY , 2004 .

[2]  Baruch Awerbuch,et al.  A cost-benefit framework for online management of a metacomputing system , 1998, ICE '98.

[3]  Luciano Serafini,et al.  Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[4]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[5]  Erich Schikuta,et al.  Towards a cost model for distributed and replicated data stores , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

[6]  Arie Shoshani,et al.  Accurate modeling of cache replacement policies in a data grid , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..

[7]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[8]  Arie Shoshani,et al.  Disk Cache Replacement Algorithm for Storage Resource Managers in Data Grids , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[9]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

[10]  Floriano Zini,et al.  Evaluation of an economy-based file replication strategy for a data grid , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[11]  David Abramson,et al.  The Grid Economy , 2005, Proceedings of the IEEE.

[12]  Baruch Awerbuch,et al.  An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster , 2000, IEEE Trans. Parallel Distributed Syst..