基于ISM的动态优先级调度算法  

Dynamic Priority Schedule Algorithm Based on ISM

作　　者：余祖峰[1] 蔡启先[2] 刘明[1] 

机构地区：[1]广西工学院电子信息与控制工程系,广西柳州545006 [2]广西工学院计算机工程系,广西柳州545006

出　　处：《计算机工程》2011年第4期284-286,共3页Computer Engineering

摘　　要：在嵌入式Linux操作系统的实时调度算法中,EDF调度算法不能解决负载过载问题。为此,引进对系统负载有着良好表现的SLAD算法和BACKSLASH算法。基于ISM算法思路,提出一种动态优先级调度算法。该算法能根据一段时间内负载过载的情况,灵活地调度EDF算法和SLAD算法,从而提高系统在正常负载和过载情况下的调度效率。对实时任务截止期错失率DMR指标的测试结果证明了其改进效果。The EDF schedule algorithm, one of main real-time schedule algorithms of the embedded Linux operating system, can not solve the overload schedule. For this, the paper introduces SLAD algorithm and BACKSLASH algorithm, which have good performance of system load. According to thinking of ISM algorithm, it puts forward a kind of dynamic priority schedule algorithm. According to case of overloads within some time, the algorithm can adjust EDF algorithm and SLAD algorithm neatly, thus improves schedule efficiency of system in usual load and overload cases. Test results for real-time tasks Deadline Miss Ratio（DMR） show its improvement effect.

关 键 词：EDF调度算法 SLAD算法 BACKSLASH算法 ISM方法 LINUX内核 

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