A Data Replica Replacement Algorithm Based on Value Model
Xiaodong Yan, XU Hui-min
Abstract
Xiaodong Yan, XU Hui-min
Abstract
Adapting to the high variation environment in data grid,a data replica replacement algorithm based on value model is proposed and the arithmetic to calculate replica value is introduced.The algorithm is used on data replica replacement.When there is not enough storage space during replication,the replica whose value is the least will be deleted.This algorithm can improve and maintain a high overall throughput of grid jobs that access files in a data grid.Experimental results show that the proposed algorithm can obtain better performance for grid task to access data replica.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Adapting to the high variation environment in data grid,a data replica replacement algorithm based on value model is proposed and the arithmetic to calculate replica value is introduced.The algorithm is used on data replica replacement.When there is not enough storage space during replication,the replica whose value is the least will be deleted.This algorithm can improve and maintain a high overall throughput of grid jobs that access files in a data grid.Experimental results show that the proposed algorithm can obtain better performance for grid task to access data replica.
Key concepts: Replica, Data grid, Computer science, Grid, Replication (statistics), Grid computing, Task (project management), Throughput