计算机工程 ›› 2008, Vol. 34 ›› Issue (13): 87-88,9.doi: 10.3969/j.issn.1000-3428.2008.13.032

• 网络与通信 • 上一篇    下一篇

面向数据网格的动态复制选址策略及其应用

冯 永1,李志国1,2,钟 将1,叶春晓1,邓 伟1   

  1. (1. 重庆大学计算机学院,重庆 400030;2. 上海宝信软件西南研发中心,重庆 400041)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-07-05 发布日期:2008-07-05

Dynamic Replica Placement Strategies and Applications for Data Grids

FENG Yong1, LI Zhi-guo1,2, ZHONG Jiang1, YE Chun-xiao1, DENG Wei1   

  1. (1. College of Computer Science, Chongqing University, Chongqing 400030; 2. Southwest Research Center, Shanghai Baosight Software Corporation, Chongqing 400041)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-07-05 Published:2008-07-05

摘要: 动态复制技术对于提高数据网格的性能非常重要。鉴于目前效果较好的动态复制策略均为单选址算法,对于延迟较大、分布较广的网格存在很大局限性,提出3种多选址的动态复制策略,将其转化为经典的数学问题求解。并给出了多选址动态复制策略在远程教育资源管理中的应用。

关键词: 数据网格, 动态复制, 复制选址, 远程教育

Abstract: 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.

Key words: data grid, dynamic replication, replica placement, remote education

中图分类号: