Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (22): 50-52.

• 学术探讨 • Previous Articles     Next Articles

Priority inversion solution based on blocking scheduling

CHEN Yin-li1,PENG Shi-li1,LIAO Chun-lan2   

  1. 1.Guangdong University of Finance,Guangzhou 510520,China
    2.Panyu Polytechnic,Guangzhou 511483,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-01 Published:2007-08-01
  • Contact: CHEN Yin-li

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

陈尹立1,彭诗力1,廖春蓝2   

  1. 1.广东金融学院,广州 510520
    2.番禺职业技术学院,广州 511483
  • 通讯作者: 陈尹立

Abstract: 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,and brings forward a new blocking scheduling algorithm.It can effectively prevent priority inversion and detect deadlocks,and has higher resources efficiency and broader applicability.

Key words: blocking scheduling, priority inversion, priority ceiling protocol, deadlock

摘要: 目前通常采用优先级上限协议解决策略,但该协议的系统资源利用率较低。针对该问题,深入分析了优先级反转的必要条件并提出了一种新的阻塞调度算法,能有效的避免优先级反转和检测死锁现象,同时具有较高的资源利用率和较广的适用范围。

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