问题描述（单资源）

Dijkstra(1965)年提出了一种能够避免死锁的调度方法，称为银行家算法。它的模型基于一个小城镇的银行家，描述如下：假定一个银行家拥有资金，数量为Ё，被N个可户共享。银行家对可户提出下列约束条件：

Ⅰ.每个客户必须预先说明自己所要求的最大资金量；

Ⅱ.每个客户每次提出部分资金量申请和获得分配；

Ⅲ.如果银行家满足了客户对资金的最大需求量，那么，客户在资金运作后，应在有限时间内全部归还银行。-problem descr iption (single-resources) Dijkstra (1965), presents a deadlock to avoid the scheduling method, known as the banker's algorithm. The model is based on a small town banker, is described as follows : Suppose a banker possession of capital, the number of symbols, N families can share. Bankers to be bound by households following conditions : 1. Each customer must explain their advance requested by the largest amount of funds; II. Each customer part of the funds they raise the volume of applications and allocation; III. If the bankers to meet customer demand for the largest funds, then customers the financial operation, in the limited time should be returned within banks.