摘要： 提出了一个无资源管理自协调网格计算模型，描述了该模型的体系结构、信息管理和递归资源调度机制。在该模型中，不存在任何管理节点，所有节点功能相同，采用改进的eager scheduling来屏蔽环境的动态性。对该模型的性能进行了初步分析，仿真结果表明，该模型能充分利用Internet上空闲的计算资源，用以解决大规模分布式应用问题。
关键词:
网格计算,
资源管理,
自协调,
递归调度
Abstract: A self-coordination grid computation model without resource management is proposed. The architecture, information management and recursive resource schedule algorithm of this model are presented. In this model, there hasn’t any managing node, and all the nodes have the same function, it uses the algorithm of evolutional eager scheduling to solve the dynamic of environment. Furthermore the preliminary performance evaluations are made, the simulation results show that this model can harvest the idle time of Internet connected computers to run very large distributed applications.
Key words:
Grid computation,
Resource management,
Self-coordination,
Recursive schedule
杨愚鲁;何 凯;于 洋;杨学刚. 无资源管理自协调网格计算模型的研究[J]. 计算机工程, 2006, 32(24): 87-89.
YANG Yulu; HE Kai; YU Yang; YANG Xuegang. Study of Self-coordination Grid Computation Model Without Resource Management[J]. Computer Engineering, 2006, 32(24): 87-89.