178
The banker’s algorithm
nA state is safe iff there exist a sequence {P1..Pn} where
each Pi is allocated all of its needed resources to be run to
completion
uie: we can always run all the processes to completion from a
safe state
nThe safety algorithm is the part that determines if a state is safe
nInitialization:
uall
processes are said to be “unfinished”
uset
the work vector to the amount resources
available: W(i) = V(i) for all i;