网格环境中带度约束的多播资源查找算法  

A Degree-constrained Multicasting Algorithm of Resource Lookup in Grid

作　　者：于显平[1] 蒲汛[1] 余建桥[1] 

机构地区：[1]西南大学计算机与信息科学学院,重庆400715

出　　处：《计算机科学》2007年第4期56-58,共3页Computer Science

基　　金：重庆市科委项目(20038035)资助

摘　　要：网格计算的前提是资源查找。本文分析研究了几种适应某些网格资源模型的现有资源查找算法及其时间和空间复杂度。针对有多播特征的网格环境中的资源查找,基于多播功能,同时赋予资源节点不同权值,构造带度的多播网格资源模型,提出带度约束的多播资源查找算法。与现有算法相比,此算法能更有效实现多播网格环境中资源的快速查找。The premise of Computing-Grid is searching of resource. This article studied the existing resource locating algorithms and analyzed their cost of time and space. Aiming at searching of resource under the grid environment having characteristic-multicasting, this paper constructed a multicasting grid resource model using the degree of the resource node to represent the resource locating ability of each node, presented a Degree-Constrained Multicasting Algorithm which provide a more effective resource locating method than existing others in that model.

关 键 词：网格 资源查找 多播 带度约束 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]