期刊文献+

基于分层结构和树型覆盖网络的网格资源发现模型 被引量:4

Grid Resource Discovery Model Based on Hierarchical Architecture and Tree Overlay Network
下载PDF
导出
摘要 针对现有网格资源发现方法的不足,提出了一种基于分层结构和树型覆盖网络的网格资源发现模型.该模型将网格从逻辑上分成上下两层:下层由拥有各种网格资源和服务的网格资源节点组成;上层为网格信息节点组成的可靠分布树型覆盖网络,负责信息节点的组织、管理和资源定位.该模型以分层的方法来改进大规模分布网格环境资源发现的可扩展性,以可靠的树型覆盖网络来提高资源发现的效率,以并行方式来实现快速资源定位,以完全分布的方式组织信息节点来解决资源信息更新和维护问题.实验结果验证了所提出模型的有效性. In order to solve the problems existing in the current grid resource discovery methods,a new grid resource discovery model based on the hierarchical architecture and the tree overlay network is proposed.In this model,the grid is logically divided into two layers: the lower one consisting of common grid nodes with various grid resources and services,and the upper one as a reliable tree overlay network consisting of grid information nodes,which takes charge of the organization,management and resource discovery of information nodes.By using the hierar-chical approach,the scalability of large-scale grid resource discovery is improved.By adopting reliable tree overlay networks,the efficiency of resource discovery is raised.Besides,by introducing a parallel mode,a rapid resource searching is implemented.Thus,the update and maintenance of resource information is effectively guaranteed by organizing the grid information nodes in an absolute distributed manner.Experimental results reveal that the proposed model is effective.
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第5期6-12,共7页 Journal of South China University of Technology(Natural Science Edition)
基金 广东省自然科学基金资助项目(05300200) 粤港关键领域重点突破项目(2005A10307007)
关键词 网格 资源发现 覆盖网络 分层结构 grid resource discovery overlay network hierarchical architecture
  • 相关文献

参考文献10

  • 1Raman R, Livny M, Solomon M. Matchmaking: distributed resource management for high throughput computing [ C ]// Proc of the 7th IEEE High Performance Distributed Computing. Washington DC : IEEE, 1998 : 140-146.
  • 2Bellwood T, Cl'ement L, Ehnebuske D, et al. UDDI version 3.0 published specification [ EB/OL ]. (2008-10-19). http ://uddi. org/pubs/uddi_v3, htm.
  • 3Rowstron A, Druschel P. Pastry : scalable, decentralized object location and routing for large-scale peer-to-peer system [C]//Proc of the 18th IFIP/ACM Int'l Conf on Distributed Systems Platforms. Heidelberg: ACM, 2001 : 329-350.
  • 4Iamnitchi A,Foster I. A peer-to-peer approach to resource location in grid environments [ M]//Weglarz J,Nabrzyski J. Grid Resource Management. Dordrecht : Kluwer Publishing, 2003.
  • 5Basu S, Banerjee S, Sharma P, et al. NodeWiz: peer-topeer resource discovery for grids [C] //Proceedings of IEEE/ACM GP2PC. Los Alamitos : IEEE ,2005:213-220.
  • 6Kleinberg J. The small-world phenomenon:an algorithmic perspective [ R]. Ithaca: Department of Computer Science, Cornell University ,2000.
  • 7Roth P C,Arnold D C,Miller B P. MRNet:a software-based multicast/reduction network for scalable tools [ C ]//Proc of the ACM/IEEE Supercomputing Conference. Phoenix, Arizona : IEEE, 2003 : 21-36.
  • 8林伟伟,齐德昱,刘波.基于资源融合的网格任务调度模型与算法[J].华南理工大学学报(自然科学版),2008,36(1):32-37. 被引量:4
  • 9Lu Q,Cao P,Cohen E, et al. Search and replication in unstructured peer-to-peer networks [ C ]//Proc of the Int'l Conf on Measurements and Modeling of Computer Systems. New York : ACM, 2002 : 84-95.
  • 10Calvert K,Zegura E. GT-ITM [ CP/OL]. (2007-07-26 ). http ://www. cc. gatech, edu/projects/gtitm.

二级参考文献12

  • 1林伟伟,齐德昱.树型网格环境TGrid的模型及算法[J].华南理工大学学报(自然科学版),2007,35(1):89-93. 被引量:4
  • 2Hall N, Potts C N, Sriskandarajah C. Parallel machine scheduling with a common server [ J ]. Discrete Applied Mathematics, 2000,102 : 223- 243.
  • 3Kravchenko S A, Wemer F. Parallel machine scheduling problems with a single server [ J ]. Mathematical Computational Modelling, 1997,26 : 1-11.
  • 4Cheng Y C, Robertazzi T G. Distributed computation for a tree network with communication delays [ J ]. IEEE Transactions on Aerospace and Electronic Systems, 1990,26 (3) :511-516.
  • 5Veeravalli B, Yao J. Divisible load scheduling strategies on distributed multi-level tree networks with communication delays and buffer constraints [ J]. Computer Communications,2004,27( 1 ) :93-110.
  • 6Beaumont O,Casanova H ,Legrand A ,et al. Scheduling divisible loads on star and tree networks:results and open problems [ J ]. IEEE Transactions on Parallel and Distributed Systems,2005,16 (3) : 207- 218.
  • 7Braun T D, Siegel H J, Beck N. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems [ J ]. Journal of Parallel and Distributed Computing, 2001,61 (6) :810-837.
  • 8Vincenzo D M, Marco M. Sub optimal scheduling in a grid using genetic algorithms [J]. Parallel Computing, 2004,30(5/6) :553-565.
  • 9Casanova H. Simgrid:a toolkit for the simulation of application scheduling [ C ]//Craig A L, Paul P. Proc of the 1 st IEEE/ACM Int'l Syrup on Cluster Computing and Grid. Brisbane: IEEE ,2001:430-437.
  • 10Abraham A, Buyya R, Nath B. Nature's heuristics for scheduling jobs on computational Grids [C]//Proc of the 8th IEEE International Conference on Advanced Computing and Communications. Cochin : IEEE ,2000:45-52.

共引文献3

同被引文献46

引证文献4

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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