检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:XU PengZhi WU YongWei HUANG XiaoMeng YANG GuangWen ZHENG WeiMin
机构地区:[1]Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
出 处:《Science China(Information Sciences)》2011年第1期1-11,共11页中国科学(信息科学)(英文版)
基 金:supported by the National Natural Science Foundation of China(Grant Nos.60573110,90612016, 60673152,60773145);the National High-Tech Research & Development Program of China(Grant Nos.2006AA01-A101,2006AA01A106,2006AA01A108,2006AA01A111,2006AA01A117);the National Basic Research Program of China(Grant Nos.2003CB317007,2004CB318000)
摘 要:Replication technique can improve access performance and data availability of data grid systems. So far, most related work on data replication in data grid systems focuses on read-only dataset. Though write operations have been widely used in practice, its optimization problem has not been sufficiently studied. In this paper, we show that write requests from users can be processed by a nearest site, regardless of the location of latest written replicas. The policy of write nearby instead of write to the latest replica can improve the performance of write operations, while inconsistency is caused between multiple replicas. Therefore, we propose two metadata nlanagement algorithms to make sure that users can retrieve up-to-date datasets at any time. We extend OptorSim to support the implementation and evaluation of our scheme. The results of simulation show that our scheme achieves performance gains up to 3.3 compared with WriteMaster scheme.Replication technique can improve access performance and data availability of data grid systems. So far, most related work on data replication in data grid systems focuses on read-only dataset. Though write operations have been widely used in practice, its optimization problem has not been sufficiently studied. In this paper, we show that write requests from users can be processed by a nearest site, regardless of the location of latest written replicas. The policy of write nearby instead of write to the latest replica can improve the performance of write operations, while inconsistency is caused between multiple replicas. Therefore, we propose two metadata nlanagement algorithms to make sure that users can retrieve up-to-date datasets at any time. We extend OptorSim to support the implementation and evaluation of our scheme. The results of simulation show that our scheme achieves performance gains up to 3.3 compared with WriteMaster scheme.
关 键 词:REPLICATION data grid SIMULATION access latency
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222