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

基于P-Tree的网格资源定位方法

Resource-location method of grid based on P-Tree
下载PDF
导出
摘要 网格环境中,如何高效准确地定位分布在不同结点上的资源一直是研究的热点。在研究P-Tree定位方法的基础上,通过分析网格资源的发布和查询过程,针对现有网格资源具有多维属性的特点,运用数值范围属性支持的多维属性定位方法的思想,提出了基于范围查询的多维属性定位方法。分析和模拟实验结果表明,该方法能够在较小的通信开销下有效实现资源定位并具有良好的可扩展性。最后,指出下一步研究的方向。 In grid environment, the key problem that confronts researchers is how to highly accurately locate different nodes that stores data items. Based on studying the location method of P-Tree, by analyzing process of the publish and query of gird resources, aimed at the characteristics of present grid resources and using the method of multidimensional attributes supported by numerical value range, it addresses a multidimensional attributes location method on the basis of range queries. The analysis and simulative experiment results indicate that this method has a high efficiency under smaller communication overhead and good scalability. In the end, the next researched direction is given.
作者 徐玉伟 赵文静
机构地区 西安建筑科技大学信息与控制工程学院
出处 《计算机工程与设计》 CSCD 北大核心 2008年第2期364-366,共3页 Computer Engineering and Design
基金 陕西省自然科学基金项目(2003F25)
关键词 网格 P-树 资源定位 范围查询 B+树 grid P-Tree resource-location range-query B＋Tree
分类号 TP302.1 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献11

  • 1Haynos M, Perspectives on grid: Grid computing next-generation distributed computing[EB/OL].http://www- 128.ibm.com/ developerworks/grid/library/gr-heritage/.
  • 2Karl C,Steven F, Ian F, et al.Grid information services for distributed resource sharing[C].10th IEEE International Symposium on High-Performance Distributed Computing.IEEE Press,2001: 181-194.
  • 3Tom Bellwood. Understanding UDDI [EB/OL]. http://www- 128.ibm.com/developerworks/library/ws-featuddi/index.html? S_TACT=105AGX52&S_CMP=cn-a-ws.
  • 4Ion S,Robert M,David L-N,et al.Chord: A scalable peer-to-peer lookup protocol for intemet applications [C].Ellen W Z.IEEE/ ACM Transactions on Networking.New York:ACM Press,2003: 17-32.
  • 5Sylvia R,Paul F,Mark H,et al.A scalable content-addressable network [C]. Proceedings of ACM SIGCOMM. New York: ACM Press,2001: 161-172.
  • 6Antony R, Peter D.Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[C].Heidelberg, Germany:Proc of the 18th IFIP/ACM International Conference on Distributed Systems Platforms(Middleware),2001.
  • 7Adina C,Prakash L,Johannes G, et al.Querying peer-to-peer networks using P-Trees[C].Comell University TR,2004.
  • 8夏启志,谢高岗,闵应骅,李忠诚.IS-P2P:一种基于索引的结构化P2P网络模型[J].计算机学报,2006,29(4):602-610. 被引量：39
  • 9董方鹏,龚奕利,李伟,查礼.网格环境中资源发现机制的研究[J].计算机研究与发展,2003,40(12):1749-1755. 被引量：63
  • 10胡志刚,谭树斐,桂卫华,陈建二,陈松乔.一种基于Chord的网格资源定位方法[J].中南大学学报（自然科学版）,2005,36(3):465-469. 被引量：4

二级参考文献45

  • 1Czajkowski K, Fitzgerald S, Foster I. Grid information services for distributed resource sharing [A]. Thomas D. Proceeding of the 10th IEEE HPDC [C]. Washington, DC: IEEE Computer Society Press, 2001. 181 -194.
  • 2Raman R, Livny M, Solomon M. Matchmaking: distrbuted resource management for high throughput computing [A]. Schaeffer J. Proceeding of the 7th IEEE HPDC [C]. Washington, DC: IEEE Computer Society Press, 1998. 140 - 146.
  • 3Rompothong P, Senivongse T. A query federation of UDDI registries [A]. Aleksy M, Coffey T. Proceedings of the 1st international symposium on information and communication technologies [C]. Dublin: Trinity College Dublin Press, 2003. 561 - 566.
  • 4Stoica I, Morris R, Karger D. Chord: a scalable peerto-peer lookup service for internet applications [A].Proceeding of ACM SIGCOMM 2001 [C]. New York:ACM Press, 2001. 149 - 160.
  • 5Stoica I, Morris R, Liben-nowell D. Chord: a scalable peer-to-peer lookup protocol for internet applications[A]. Ellen W Z. IEEE/ACM Transactions on Networking [C]. New York: ACM Press, 2003. 17 - 32.
  • 6Singh M G. Routing networks for distributed hash tables [A]. Anon. Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing [C]. New York: ACM Press,2003. 133 - 142.
  • 7Loguinov D, Kumar A, Rai V. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience [A]. Anon. Proceedings of the 2003 Conference on Applications, Technologies,Architectures, and Protocols for Computer Communications [C]. New York: ACM Press, 2003. 395 -406.
  • 8Ratnasamy S, Francis P, Handley M. A scalable content-addressable network [A]. Anon. Proceedings of ACM SIGCOMM2001 [C]. New York: ACM Press,2001. 161 - 172.
  • 9Rowstron A , Druschel P. Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems [A]. IFIP/ ACM International Conference on Distributed Systems Platforms [C].Heidelberg, 2001.
  • 10Legrand A, Marchal L, Casanova H. Scheduling distributed applications: the Simgrid simulation framework [A]. Lee S, Sekiguchi M S. Proceedings of the 3th International Symposium on Cluster Computing and the Grid [C]. Washington, DC: IEEE Computer Society Press, 2003. 138.

共引文献102

计算机工程与设计
2008年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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