网格环境下基于双服务器和时间优先的资源查找法

Resource locating algorithm based on DSTF under grid environment

对网格环境下现有查找方法进行了简要分析和比较,指出了其中存在的不足,提出了基于双服务器和时间优先的资源查找算法(Dual Serve&Time First,简称DSTF)。对这些资源查找方法进行了时间和空间复杂度分析,结果表明DSTF算法的时间复杂度不大,其空间复杂度小,是网格环境下一种有效的资源查找方法。

The existing resource locating methods are compared and their insufficiency is pointed out. A new algorithm based on the dual-server and time-first (DSTF) mechanism is presented. The time and space costs of all these algorithms are analyzed. The results show that the DSTF algorithm costs the tolerable time and the least space. As a conclusion the DSTF algorithm is effective under the grid environment.