How can I prove whether lunch philosophers suffer from dead end or hungry opportunities? When to start?

Question

I have a homework task to prove whether a particular version of the philosopher monkey problem suffers from an impasse or starvation. I suspect that the situation does not suffer at all, but I find it difficult to prove, and I do not know where to start. Is there a general strategy to attack this problem?

Answer 1

You can read about Wait-for graphs (more info here ), which are DAGs (Directed Acyclic Graphs) and are used to detect deadlocks.

amuses

Answer 2

, , , , .

, , : - , ? , ( , , ) .

, : , , ( ), , , ", , [ ]..."