银行家算法是一种最有代表性的避免死锁的算法。在避免死锁方法中允许进程动态地申请资源，但系统在进行资源分配之前，应先计算此次分配资源的安全性，若分配不会导致系统进入不安全状态，则分配，否则等待。为实现银行家算法，系统必须设置若干数据结构。-Banker' s algorithm is one of the most representative algorithm to avoid deadlock. Method to avoid deadlock in the process of dynamically allowed for resources, but the system before carrying out the allocation of resources, the allocation of resources to be counted the security, if the distribution does not cause the system to enter unsafe state, the distribution, or wait. To achieve the banker' s algorithm, the system must be set to a number of data structures.