摘要
军用网格环境下的资源调度与一般网格环境下的资源调度相比较,一个明显的特点就是必须考虑一些特别任务的优先级。在给出网格独立任务调度模型基础上,提出了一种基于优先权的Min-Min资源调度算法,该算法首先调度优先级高的任务,其余任务则采用Min-Min算法调度。经过分析,该算法的时间复杂度是O(n2m),与Min-Min相比,该算法的Makespan可能略大,但可以满足军用网格环境下特殊任务优先执行的需求。
Comparing the task scheduling based on the military grid and common grid, a distinct characteristic is that the priority of some special tasks must be considered. Based on giving a model of grid irrelative-task scheduling, a priority-based scheduling algorithm of Min-Min resource is proposed. The algorithm schedules the high priority task firstly, then schedules other tasks using Min-Min scheduling algorithm. The time complexity of the algorithm is O（n^2m）. Compared with the Min-Min algorithm, the Makespan is the bigger, but the algorithm can meet the demand of special task prior to implement in military grid.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第12期8-11,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(60272022)
关键词
军用网格
独立任务
任务优先级
调度算法
Military grid, Irrelative-task, Task priority, Scheduling algorithm
