银行家算法又称“资源分配拒绝”法，其基本思想是：系统中的所有进程放入进程集合，在安全状态下系统受到进程的资源请求后，先把资源试探性地分配给它。现在，系统将剩下的可用资源和进程集合中的其它进程还需要的资源数作比较，找出剩余资源能满足最大需求量的进程，从而保证进程运行完毕并归还全部资源。这时，把这个进程从进程金额和中删除，归还其所占用的所有的资源，系统的剩余资源更多。反复执行上述步骤。最后，检查进程集合，若为空则表明本次申请可行，系统处于安全状态，可以真正实施本次分配；否则，只要进程集合非空，系统便处于不安全状态，本次资源分配暂不实施，让申请资源的进程等待。-Bankers algorithm, also known as " resource allocation refuse"　method, the basic idea is: all the processes in the system into the process of collection system in a safe state by the process of resource requests, the first resource tentatively assigned to it. Now, the system will be the rest of the available resources and the process of collection of other processes also need the number of resources compared to identify the remaining resources to meet the maximum demand of the process, so as to ensure that the process has finished running, and the return of all the resources. At this time, this process is removed from the process amounts and in the return of all the resources of the occupied more of the system　s remaining resources. Repeatedly performing the above steps. Finally, check the process of collection, it indicates that the application is feasible if it is empty, the system is in a safe state, can really implement the allocation　otherwise, as long as the process