说明：  银行家算法可以避免死锁。算法结构 n : 系统中进程个数 m :系统中的资源类数 1）available(m):现有资源向量 2） max（n,m）:资源最大申请量 3)allocation(n,m)：资源分配矩阵 4）need（n,m）:进程以后还需要的资源矩阵 5）request(n,m)：进程申请资源矩阵
(Banker s algorithm to avoid deadlock. Algorithm structure n: the system process the number of m: System resources class number 1) available (m): existing resources, vector 2) max (n, m): maximum application volume of resources 3) allocation (n, m): Resource Allocation Matrix 4) need (n, m): the process after the resources needed matrix 5) request (n, m): the process of application resources matrix)