<P> Deadlock freedom can be expanded to implement one or both of these properties: </P> <Ul> <Li> Lockout - freedom guarantees that any process wishing to enter the critical section will be able to do so eventually . This is distinct from deadlock avoidance, which requires that some waiting process be able to get access to the critical section, but does not require that every process gets a turn . If two processes continually trade a resource between them, a third process could be locked out and experience resource starvation, even though the system is not in deadlock . If a system is free of lockouts, it ensures that every process can get a turn at some point in the future . </Li> <Li> A k - bounded waiting property gives a more precise commitment than lockout - freedom . Lockout - freedom ensures every process can access the critical section eventually: it gives no guarantee about how long the wait will be . In practice, a process could be overtaken an arbitrary or unbounded number of times by other higher - priority processes before it gets its turn . Under a k - bounded waiting property, each process has a finite maximum wait time . This works by setting a limit to the number of times other processes can cut in line, so that no process can enter the critical section more than k times while another is waiting . </Li> </Ul> <Li> Lockout - freedom guarantees that any process wishing to enter the critical section will be able to do so eventually . This is distinct from deadlock avoidance, which requires that some waiting process be able to get access to the critical section, but does not require that every process gets a turn . If two processes continually trade a resource between them, a third process could be locked out and experience resource starvation, even though the system is not in deadlock . If a system is free of lockouts, it ensures that every process can get a turn at some point in the future . </Li> <Li> A k - bounded waiting property gives a more precise commitment than lockout - freedom . Lockout - freedom ensures every process can access the critical section eventually: it gives no guarantee about how long the wait will be . In practice, a process could be overtaken an arbitrary or unbounded number of times by other higher - priority processes before it gets its turn . Under a k - bounded waiting property, each process has a finite maximum wait time . This works by setting a limit to the number of times other processes can cut in line, so that no process can enter the critical section more than k times while another is waiting . </Li>

When a is distributed by an outside explosion