以LINK LIST所編寫成的銀行家演算法

a.可用的 Allocation ( i )：表示第 i 個處理單元目前已分配到的資源數目。

b.最大值Max ( i )：表示第 i 個處理單元所要求資源的總數量。

c.需求Need ( i )：表示第 i 個處理單元尚需要的資源數量；即

Need ( i ) = Max ( i ) - Allocation ( i )

d.可用的 Available：表示系統中尚未使用的資源數目-LINK LIST compiled by the bankers of the available algorithms a. Allocation (i): i-th processing unit has been assigned to the number of resources. b. Max Max (i): i-th processing unit the total number of required resources. c. Requirements Need (i): i-th processing unit is still the amount of resources required　that Need (i) = Max (i)- Allocation (i) d. Available Available: that the system the number of unused resources