Since the resource has the characteristics of dynamics and heterogeneous, task scheduling becomes a very complex and challenging problem in the grid computing.

由于资源具有异构、动态等特性，计算网格环境下的调度就成了一个非常复杂且具有挑战性的问题。

youdao

Grid resource scheduling problem is proved to be an NP complete problem, and genetic algorithms are proved to be sharpen tools to solve NP-complete problem.

网格资源调度问题被证明是一个NP完全问题，而遗传算法是解决NP完全问题的锐利工具。

youdao

This paper investigates the idea of a completely distributed Grid resource model and task scheduling algorithm, which are based on task press, to solve this bottleneck problem.

论文提出了一种完全分布的网格资源管理模型，即在网格中没有任何全局的资源信息，同时提出了与此资源模型相适应的基于任务压力的网格任务调度算法。

youdao