摘要
动态复制技术对于提高数据网格的性能非常重要。鉴于目前效果较好的动态复制策略均为单选址算法,对于延迟较大、分布较广的网格存在很大局限性,提出3种多选址的动态复制策略,将其转化为经典的数学问题求解。并给出了多选址动态复制策略在远程教育资源管理中的应用。
Within data grid environments, dynamic replication is a general mechanism to improve performance and availability for distributed applications. 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, three multiple-location strategies are proposed, which are converted into classical mathematic problems that can be solved by some famous approximation algorithms. The strategies are suitable for resource management in the remote education.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第13期87-88,91,共3页
Computer Engineering
基金
国家“十一五”重大科技攻关基金资助项目(2006BAH02A24-6)
国家社会科学“十一五”规划教育学重点课题基金资助项目(ACA07004-08)
重庆市科委自然科学基金资助项目(2007BB2192)
重庆市高等教育教学改革研究基金资助重大项目(0616001)
关键词
数据网格
动态复制
复制选址
远程教育
data grid
dynamic replication
replica placement
remote education