180
The banker’s algorithm
nLet Q(j,i) be the amount of resource type i requested by
process j.
nTo determine if this request should be granted we use
the banker’s algorithm:
uIf Q(j,i) <= N(j,i) for all i then continue. Else raise error
condition (claim exceeded).
uIf
Q(j,i) <= V(i) for all i then continue. Else wait (resource not
yet available)
uPretend that the request is granted and determine the new
resource-allocation state: