a system consisting of m resources of the same type, being shared by n processes. resources can be requested and released by processes only one at a time. the system is deadlock free if 1) the maximum need of each process is between 1 and m resources and 2) the sum of all maximum needs is less than m n.