检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆教育学院计算机与现代教育技术系,重庆400067 [2]贵州省电子计算机软件开发中心,贵州550000
出 处:《系统仿真学报》2008年第18期4854-4858,共5页Journal of System Simulation
基 金:重庆市教育委员会2007年科学技术研究项目支持(KJ071503)
摘 要:数据网格提供了地理分布的大量共享数据资源,然而互联网的高访问延迟降低了数据访问的效率,创建副本是一个有效的方法,而在何处放置副本是一个具有挑战性的问题。从应用环境和用户访问特征出发,讨论了副本创建位置、粒度和时机,提出了一种基于副本共享组的副本创建模型,可以获得优化的副本创建位置,构造了一个副本创建代价函数,由系统的传输速率、拓扑结构和用户访问特征共同决定,并给出了确定副本创建位置的有效算法。分析和仿真实验表明,自适应副本管理方案具有动态性、适应性和可扩展性,能较好地适应数据网格的特性,可以有效降低访问延迟,提高数据访问效率。Data Grid provides geographically distributed data resources. However, ensuring efficient and fast access to such huge and widely distributed data is hindered by the high latencies of the Internet. Data replication is an effective approach and one of the challenges in data replication is to select the candidate sites to place replicas. To address this problem an adaptive replication strategy RGRS(Replica Group based Replication Strategy) was introduced, which was dynamically depending on current conditions, offering improved scalability of the overall system, and was able to achieve optimized placement location. Replication placement decisions were made based on a cost model that evaluated data access costs and performance gains of creating each replica. Meanwhile, the granularity and creating time of replica were discussed. Through analysis and simulations, the results prove that the replication strategy is dynamic, adaptive and scalable, improving the performance of the data access in Data Grid.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.220.22.253