首页 | 本学科首页   官方微博 | 高级检索  
     

军用网格环境下基于优先权的Min-Min任务调度算法
引用本文:曹耀钦,赵霜,宋建社.军用网格环境下基于优先权的Min-Min任务调度算法[J].微电子学与计算机,2006,23(12):8-11.
作者姓名:曹耀钦  赵霜  宋建社
作者单位:第二炮兵工程学院,信息工程研究所,陕西,西安,710025
摘    要:军用网格环境下的资源调度与一般网格环境下的资源调度相比较,一个明显的特点就是必须考虑一些特别任务的优先级。在给出网格独立任务调度模型基础上,提出了一种基于优先权的Min—Min资源调度算法,该算法首先调度优先级高的任务,其余任务则采用Min—Min算法调度。经过分析,该算法的时间复杂度是O(n^2m),与Min—Min相比,该算法的Makespan可能略大,但可以满足军用网格环境下特殊任务优先执行的需求。

关 键 词:军用网格  独立任务  任务优先级  调度算法
文章编号:1000-7180(2006)12-0008-04
收稿时间:2005-11-05
修稿时间:2005-11-05

A Min-Min Task Scheduling Algorithm Priority-based in Military Grid Environment
CAO Yao-qin,ZHAO Shuang,SONG Jian-she.A Min-Min Task Scheduling Algorithm Priority-based in Military Grid Environment[J].Microelectronics & Computer,2006,23(12):8-11.
Authors:CAO Yao-qin  ZHAO Shuang  SONG Jian-she
Abstract: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(n2m).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.
Keywords:Military grid  Irrelative-task  Task priority  Scheduling algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号