数据网格的多选址动态复制策略及其应用研究  

Multiple-location dynamic replication strategies of data grids and their application research

作　　者：冯永[1] 钟将[1] 李志国[1,2] 叶春晓[1] 

机构地区：[1]重庆大学计算机学院,重庆400030 [2]上海宝信软件西南研发中心,重庆400041

出　　处：《计算机工程与应用》2008年第19期210-212,248,共4页Computer Engineering and Applications

基　　金：重庆市科委自然科学基金计划资助项目(No.2007BB2192,No.2007BB2372);浦东新区科技发展基金(No.PKK2005-07);重庆大学研究生院创新项目(No.200506Y1A0230130)

摘　　要：动态复制技术对于提高数据网格的性能非常重要。对目前的动态复制策略进行了综述,鉴于目前效果较好的动态复制策略均为单选址算法,对于延迟较大、分布较广的网格存在很大局限性,提出三种多选址的动态复制策略,并将其转化为经典的数学问题进行求解。然后,给出了多选址动态复制策略在大规模分布式资源管理中的应用。Within data grid environments,dynamic replication is a general mechanism to improve performance and availability for distributed applications.In the paper,the authors firstly review the dynamic replication strategies till now.As the experimentally efficient strategies are based on single-location algorithms,they are not suitable for geographically broad grids with long latency. To address such issues,the authors propose three multiple-location strategies,which are converted into classical mathematic problems that can be solved by some famous approximation algorithms.Then,the authors explain that the strategies are suitable for resource management in the large-scale distributed resource management.

关 键 词：数据网格 动态复制 复制选址 大规模分布式资源管理 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]