摘要
针对基于查表方式的优先级位图算法占用存储空间较大的问题,提出2种能够减少存储空间占用的改进算法。改进算法1通过去除原表中的冗余数据,缩小表格的大小;改进算法2完全脱离查表思想,采用一种新的方法获得当前具有最高优先级的就绪态任务。分析结果表明,优化后的算法可以有效节省系统的存储空间。
Two enhanced algorithms are proposed to solve the problem that the lookup table based priority bit map algorithm occupies a large storage space.One of the optimized algorithms reduces the size of the table by remove the redundant data from table.The other optimized algorithm gets the highest priority task which is in the ready state by a new method.It completely rejects the way of Lookup-table.Analysis result shows the enhanced algorithm can save a large storage space.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第14期271-273,共3页
Computer Engineering
关键词
优先级位图
查表
存储空间
C语言
priority bit map
lookup table
storage space
C programming language
