170
Prevention of circular wait
uunder
this protocol, this means:
FO(R0) < O(R1) < .. < O(Rn) < O(R0) impossible!
nThis protocol prevents deadlock but will often deny
resources unnecessarily (inefficient) because of the ordering imposed on the
requests