An example talked about in class was the Dining Philosophers Problem (http://en.wikipedia.org/wiki/Dining_philosophers_problem). It's a nice, simple example that lets you test out some deadlock-avoidance systems.
Corian
I don't really understand the second example. Wouldn't the process with the highest ID still be able to get work done since it can't send a message unless the processId it sends to gets looped around back to 0?
An example talked about in class was the Dining Philosophers Problem (http://en.wikipedia.org/wiki/Dining_philosophers_problem). It's a nice, simple example that lets you test out some deadlock-avoidance systems.
I don't really understand the second example. Wouldn't the process with the highest ID still be able to get work done since it can't send a message unless the processId it sends to gets looped around back to 0?