一种基于动态优先级的RQ作业调度算法  

Scheduling Algorithm Named RQ Based on Dynamic Priority

作　　者：李薛剑[1,2] 李凯[2] 

机构地区：[1]中国科学技术大学计算机科学与技术学院,合肥230026 [2]安徽大学计算机科学与技术学院,合肥230601

出　　处：《小型微型计算机系统》2017年第1期124-128,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61300169;61170018)资助;安徽大学211经费资助

摘　　要：传统FCFS调度算法虽然易于实现,但未能解决紧急作业等待问题;而传统优先级调度算法在保证紧急作业优先完成的情况下,对一般作业极不公平.依据此两种调度策略,提出一种基于动态优先级驱动的RQ(Rank Queue)作业调度算法,合理解决优先级和公平性之间的矛盾.该算法将作业划分为四个等级,并依次分配到预先设置的4个等待队列上,等待队列设置不同的优先级阈值.动态调整优先级,达到阈值后提升到就绪队列.实验表明:RQ算法在提高资源利用率的同时大大缩短了高优先级作业的响应时间.The traditional FCFS scheduling algorithm is easy to implement, but it cannot solve the waiting problem of emergency oper- ation. And the traditional priority scheduling algorithm always guarantees the priority of emergency operations,so it is not fair for the general operation. According to these two scheduling strategies, this paper proposes a RQ scheduling algorithm based on dynamic prior- ity driven, which can settles the contradiction between priority and fairness properly. This algorithm divides the job into four grades, and allocates them to four preset waiting queues successively. The waiting queue is set to different priority thresholds. The waiting queue will be promoted to the ready queue after the priority is adjusted dynamically to reach the threshold. The experiment results indi- cates that the RQ scheduling algorithm can not only improve the resource utilization rate but also shorten the response time of high-pri- ority jobs greatly.

关 键 词：等级 等待队列 优先级阈值 动态优先级 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]