基于广义表的银行家算法

Modified banker algorithm based on lists

分析了使用传统的银行家算法降低系统资源使用效率的主要原因是使用了事先声明的全局最大资源需求量 ;提出了一种改进算法 ,该算法用广义表表示每个进程的控制流程及其资源请求图 。

The main reasons for normal banker algorithm to lower the utilization of computer resources are analysed.Representing the control flow of each process as a lists of nodes correspinding to resource requests and releases,a new algorithm is propesed which decomposes each flow graph into regions,and computes the maximum resources claim for each region,which will be used by normal banker algorithm to avoid deadlock,therefore the new algorithm has potential for system to better resources utilization.