基于阻塞调度的优先级反转解决策略  

Priority inversion solution based on blocking scheduling

作　　者：陈尹立[1] 彭诗力[1] 廖春蓝[2] 

机构地区：[1]广东金融学院,广州510520 [2]番禺职业技术学院,广州511483

出　　处：《计算机工程与应用》2007年第22期50-52,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.50275152)。

摘　　要：目前通常采用优先级上限协议解决策略,但该协议的系统资源利用率较低。针对该问题,深入分析了优先级反转的必要条件并提出了一种新的阻塞调度算法,能有效的避免优先级反转和检测死锁现象,同时具有较高的资源利用率和较广的适用范围。At present,an approach solving solution is priority ceiling protocol ordinarily,but the resources efficiency of the system based on the protocol is low.To the question,the paper analyses the necessary condition of priority inversion,andbrings forward a new blocking scheduling algorithm.It can effectively prevent priority inversion and detect deadlocks,and has higher resources efficiency and broader applicability.

关 键 词：阻塞调度 优先级反转 优先级上限协议 死锁 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]