期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

数据网格中一种启发式副本放置算法 被引量：2

Heuristic replica placement algorithm in data grids
下载PDF
导出
摘要 副本技术广泛用于数据网格中来减少数据访问代价,增强容错能力,从而提高数据网格中数据访问的性能和可靠性。如何合理地放置副本来更有效地提高数据访问性能成为一个需要解决的重要问题。针对无向连通图表示的数据网格模型,在考虑通信代价和存储代价的基础上,提出了一种启发式副本放置算法(heuristicreplica placement algorithm,HRPA),通过该算法能够得到k个副本的放置位置,并且使得整个系统的代价最小。最后,通过相应的仿真实验证明了该算法的可行性和有效性。 Data replication is widely used in data grids to reduce data access cost,increase ability of fault tolerance and improve performance and availability of all system.How to place the replicas to gain the highest performance has become one important problem in data grids.Based on a general data grid model represented by an undirected connected graph,a heuristic replica placement algorithm（HRPA） is proposed by considering communication cost and storage cost.By this algorithm,k replicas can get their places to make all system gain the optimal performance.At last some simulated experiments show the feasibility and effectiveness of the algorithm.
作者 付雄 王汝传 邓松
机构地区 南京邮电大学计算机学院
出处 《系统工程与电子技术》 EI CSCD 北大核心 2010年第7期1513-1516,共4页 Systems Engineering and Electronics
基金 国家自然科学基金(60573141 60773041) 江苏省自然科学基金(BK2008451) 国家高科技研究发展计划(863计划)基金(2007AA01Z404 2007AA01Z478) 中国博士后科学基金(20100471353) 江苏省博士后基金(0801019C) 江苏省六大高峰人才基金(2008118) 南京邮电大学人才引进基金(NY207135)资助课题
关键词 分布式系统 数据网格 副本放置 启发式算法 distributed systems data grid replica placement heuristic algorithm
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献13

  • 1Chervenak A,Foster I,Kesselman C,et al.The data grid:towards an architecture for the distributed management and analysis of large scientific datasets[J].Journal of Network and Computer Applications,2000,23(3):187-200.
  • 2Moore R,Baru C,Marciano R,et al.The grid:blueprint for a future computing infrastructure[M].Morgan Kaufmann Publishers,1999.
  • 3Fu X,Wang R C,Wang Y,et al.A replica placement algorithm in mobile grid environments[C] // Proc.of the 6th IEEE International Conference on Embedded Systems and Software,2009:601-606.
  • 4Deris M M,Abawajy J H,Suzuri H M.An efficient replicated data access approach for largescale distributed systems[C] // Proc.of IEEE International Symposium on Cluster Computing and Grid,2004:588-594.
  • 5Chervenak A,Schuler R,Kesselman C,et al.Wide area data replication for scientific collaborations[C] // Proc.of International Workshop on Grid Computing,2005:1-8.
  • 6Abawajy J H.Placement of file replicas in data grid environments[C] // Proc.of ICCS,Lecture Notes in Computer Science,2004:66-73.
  • 7Liu P,Lin Y F,Wu J J.Optimal placement of replicas in data grid environments with locality assurance[C] // Proc.of International Conference on Parallel and Distributed Systems,2006:465-474.
  • 8Benoit A,Rehn-Sonigo V,Robert Y.Replica placement and access policies in tree networks[C] // IEEE Trans.on Parallel and Distributed Systems,2008,12(19):1614-1627.
  • 9Garmehi M,Mansouri Y.Optimal placement replication on data grid envirments[C] // Proc.of 10th International Conference on Information Technology,2007:190-195.
  • 10Rashedur M,Ken B,Reda A.Replica placement in data grid:considering utility and risk[C] // Proc.of International Conference on Information Technology:Coding and Computing,2005:354-359.

二级参考文献11

  • 1陈磊,顾雷,李三立.医学数据网格中数据一致性问题研究及实现[J].小型微型计算机系统,2006,27(5):813-817. 被引量：2
  • 2陈磊,李三立.网格数据复本管理的动态自适应软件体系结构[J].软件学报,2006,17(6):1436-1447. 被引量：3
  • 3A Chervenak,I Foster,C Kesselman,C Salisbury,S Tuecke.The data grid:towards an architecture for the distributed management and analysis of large scientific data sets[J].Journal of Network and Computer Applications,2001,23:187-200.
  • 4W Hoschek,F J Jaen-Martinez,A Samar,H Stockinger,K Stockinger.Data management in an international data grid project[A].Proceedings of the First IEEE/ACM International Workshop on Grid Computing[C].London,UK Springer-Verlag.2000.77-90.
  • 5C Baru,R Moore,A Rajasekar,M Wan.The SDSC storage resource broker[A].Proceedings of the 1998 Conference of the IBM Centre for Advanced Studies on Collaborative Research (CASCON'98)[C].Toronto,Canada.IBM Press.1998.5-16.
  • 6O Frieder,H T Siegelmann.Multiprocessor document allocation:A genetic algorithm approach[J].IEEE Transactions on Knowledge and Data Engineering,1997,9(4):640-642.
  • 7I Foster,C Kesselman.A data grid reference architecture[R].GriPhyN-2001-12,http://www.griphyn.org,2001.
  • 8J Bester,I Foster,C Kesselman,J Tedesco,S Tuecke.GASS:a data movement and access service for wide area computing systems[A].Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems[C].Atlanta,Georgia,United States:ACM Press.1999.78-88.
  • 9C A Steed.J E Braud,K A Koehler.VGRID:a generic,dynamic HDF5 storage model for geo referenced grid data[A].Proc of MTS/IEEE OCEANS2002[C].Biloxi,Mississippi,USA:Marine Technology Society.2002.900-907.
  • 10L C Hu.S X Sun.ADS-a handle-based storage architecture under grid computing[A].Proc of the IEEE 18th Annual Workshop on Computer Communications (CCW 2003)[C].Dana Point,California,USA:IEEE Communications Society,2003.187-193.

共引文献2

同被引文献23

  • 1王文方,刘晓光,王刚,刘璟.对等网副本散布问题纯策略纳什均衡研究[J].计算机科学,2006,33(7):29-30. 被引量：3
  • 2Khan S U. Game theoretical data replication techniques for large-scale autonomous distributed computing systems [D]. Arlington : The University of Texas, 2007.
  • 3Loukopoulos T, Ahmad I. Static and adaptive distributed data replication using genetic algorithms [J]. Journal of Parallel and Distributed Computing, 2004, 64 (11) : 1270- 1285.
  • 4Laoutaris N, Zissimopoulos V, Stavrakakis I. Joint object placement and node dimensioning for internet content distribution [J]. Information Processing Letters, 2004, 89 (6) : 273 - 279.
  • 5Laoutaris N, Zissimopoulos V, Stavrakakis I. On the optimization of storage capacity allocation for content distribution [J]. Computer Networks, 2005, 47 (3) : 409 -428.
  • 6Geels D, Kubiatowicz J. Replica management should be a game [C] //Proceedings of the 10th Workshop on ACM SIGOPS European Workshop. USA: ACM, 2002: 235- 238.
  • 7Chun B G, Chaudhuri K, Wee H, et al. Selfish caching in distributed systems: A game-theoretic analysis [ C ] //Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing. USA : ACM, 2004 : 21 -30.
  • 8Goemans M X, Li L, Mirrokni V S, et al. Market sharing games applied to content distribution in ad hoc networks [C] //Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing. USA: ACM, 2004, 55 -66.
  • 9Laoutaris N, Telelis O, Zissimopoulos V, et al. Distributed selfish replication [J]. IEEE Transactions on Parallel and Distributed Systems, 2006, 17 (12): 1401-1403.
  • 10Laoutaris N, Smaragdakis G, Bestavros A, et al. Distributed selfish caching [ J ]. IEEE Transactions on Parallel and Distributed Systems, 2007, 18 (10): 1361-1376.

引证文献2

二级引证文献3

系统工程与电子技术
2010年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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