n A new process n is admitted in the system only if C(n,i) <= U(i) for all resource type i n This policy ensures that deadlock is always avoided since a process is admitted only if all its requests can always be satisfied (no matter what will be their order) n A sub optimal strategy since it assumes the worst: that all processes will make their maximum claims together at the same time