期刊文献+

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

Dynamic Replica Placement Strategies and Applications for Data Grids
下载PDF
导出
摘要 动态复制技术对于提高数据网格的性能非常重要。鉴于目前效果较好的动态复制策略均为单选址算法,对于延迟较大、分布较广的网格存在很大局限性,提出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
  • 相关文献

参考文献10

  • 1Stockinger H, Samar A, Foster I. File and Object Replication in Data Grids[J]. Journal of Cluster Computing, 2002, 5(3): 305-314.
  • 2Kavitha R, Foster I. Design and Evaluation of Dynamic Replication Strategies for a High-performance Data Gfid[C]//Proceedings of International Conference on Computing in High Energy and Nuclear Physics. Beijing, China: [s. n.], 2001: 106-118.
  • 3Rashedur R M, Barker K, Alhajj R. Replica Placement in Data Grid: Considering Utility and Risk[C]//Proceedings of IEEE International Conference on Coding and Computing. [S. l.]: IEEE Press, 2005:354-359.
  • 4Charikar M, Guha S. Improved Combinatorial Algorithms for the Facility Location and k-Median Problems[C]//Proceedings of the 40th Symposium on Foundations of Computer Science. [S. l.]: IEEE Press, 1999: 378- 388.
  • 5Lamehamedi H, Shentu Z, Szymanski B. Simulation of Dynamic Data Replication Strategies in Data Grids[C]//Proceedings of the 12th Heterogeneous Computing Workshop. Nice, Franc: [s. n.], 2003.
  • 6Ranganathan K, Iamnitchi A, Foster I. Improving Data Availability through Dynamic Model-driven Replication in Large Peer-to-Peer Communities[C]//Proceedings of the 2nd Symposium on Cluster Computing and the Grid. Berlin, Germany: [s. n.], 2002: 376.
  • 7Feige U. A Threshold of LNN For Approximating Set-cover[J]. Journal of the ACM, 1998, 45(4): 634-652.
  • 8Lili Q, Padmanabhan V N, Voelker G M. On the Placement of Web Server Replicas[C]//Proceedings of IEEE INFOCOM'01. [S. l.]: IEEE Press, 2001: 1587-1596.
  • 9何炎祥,范清风,张力飞.网格计算中动态复制策略的设计[J].计算机工程,2004,30(3):94-95. 被引量:13
  • 10Li Bo. On the Optimal Placement of Web Proxies in the Internet [C]//Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies. [S. l.]: IEEE Press, 1999: 1282-1290.

二级参考文献1

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部