摘要
在实时多任务操作系统中,由于外部事件需要有快速的反应能力,选择一种合适的任务调度算法非常重要。如果多个任务访问共享资源时,可能会导致优先级的反转问题。对此给出了目前经常采用的两种解决此问题的方法。分析了它们可能存在的不足,重点分析了优先级继承,并对它作了进一步改进。通过测试证明,该方法行之有效。
A real-time multitasking operating system requires rapid response to external events.So it is very important to select an appropriate task scheduling algorithm.If multiple tasks seeking access to shared resources will lead to priority inversion.Two kinds of solutions to resolve the problem are proposed,and their disadvantages are analyzed.The technique of priority inheritance was analyzed in detail,and was improved further.Practice and tests have proved the efficiency and practicabi-lity of this way to resolve priority inversion.
出处
《计算机应用研究》
CSCD
北大核心
2008年第6期1728-1730,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(60474019)
河北省自然科学基金资助项目(F2005000482)
关键词
实时系统
调度算法
信号量
优先级反转
优先级继承
real-time systems
scheduling algorithm
semaphore
priority inversion
priority inheritance
