摘要： 以小世界(Small-world) 模型作为理论依据，阐述了基于P2P 的自组织计算网络的构造和基于该网络的计算任务调度算法，对计算网络的若干特性(诸如高聚合性和低搜索路径) 以及调度的效能进行了分析。该文构造的计算网络表现出明显的自组织特性，具有较好的可扩展性和自组织能力，能为计算资源的调度提供很好的支持。
关键词:
网格计算；自组织网络；小世界
Abstract: According to the small-world theory, this paper gives a detailed explanation of the computing network based on P2P constructing approach, including the simulations of small-world network characteristics such as clustering coefficient and path length , and how these characteristics are selected in network computing task scheduling algorithm. Simulation results show that computing network emerges out standing self-organizing characteristics and is very suitable for computing task scheduling.
Key words:
Grid computing; Self-organizing network; Small-world
李志杰，赵跃龙，戴祖雄. 基于小世界理论的自组织计算网络有效调度算法[J]. 计算机工程, 2006, 32(9): 181-182.
LI Zhijie, ZHAO Yuelong, DAI Zuxiong. Efficient Location Mechanism Based on Small-world Theory in Self-organizing Computing Network[J]. Computer Engineering, 2006, 32(9): 181-182.