基于死锁避免的资源安全分配算法  

Improved safe resource allocation algorithm based on deadlock avoidance

作　　者：杨梅[1] 滕少华[1] 

机构地区：[1]广东工业大学计算机学院,广东广州510006

出　　处：《计算机工程与设计》2011年第1期40-43,共4页Computer Engineering and Design

基　　金：广东省自然科学基金项目(9151009001000007);广东省科技计划基金项目(2008A060201011)

摘　　要：为了提高传统资源安全分配算法效率,降低安全检查时的系统开销,提出了改进的资源安全分配算法。改进后的算法在每次安全检查时首先检查申请资源进程,一旦申请资源进程满足判定条件,便可以确定系统处于安全状态。不需要对系统中所有进程进行检查,缩小了安全检查范围,提高了系统效率。通过算法推理和实例验证,改进后的算法是可行且高效的,能更好地适应多任务系统中死锁避免的需要,实现资源的安全分配。To increase the efficiency of traditional safe resource allocation algorithm,and reduce the system overhead of safety check, the improved safe resource allocation algorithm is presented.The process applied for resources is checked firstly in each safety check, once the process satisfies the determined conditions,the systemcan be defined in a safe state.It＇s not necessary to check all the processes in system,the safety check scope is narrowed,the system efficiency is increased.The formal proof and experimental results show that the improved algorithm is effective and better for the multi-task system to avoid deadlock.

关 键 词：死锁 死锁避免 资源安全分配算法 安全检查 安全状态 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]