Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field.

• 本文提出一种新型的网格资源调度算法-最小跳数算法，首先通过广度搜索遍历找到资源，并同时生成跳数场，再根据跳数调度资源。