摘要
网格的一个重要功能就是多个虚拟机构间共享资源。网格资源调度是其中关键问题之一。本文提出一种新型的网格资源调度算法——最小跳数算法,首先通过广度搜索遍历找到资源,并同时生成跳数场,再根据跳数调度资源。通过算法仿真证明,最小跳数算法大大提高了资源调度的效率。
One of the most important functions of the grid is to share resources between multi-virtual organizations, so the scheduling of the grid resources is the key point. This paper produces a novel scheduling algorithm of the grid resources： the minimal hop algorithm. 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. It is testified by simulation implement that the minimal hop algorithm does improve the efficiency of the grid resources scheduling greatly.
出处
《核动力工程》
EI
CAS
CSCD
北大核心
2007年第3期121-124,共4页
Nuclear Power Engineering
基金
电子科技大学青年博士平台基金支助(05BS01601)
关键词
最小跳数算法
网格资源管理
广度优先遍历
仿真实现
Minimal hop algorithm, Grid resources Scheduling, Breadth first search, Simulation implement
