| Share this post! | Vote this! |
|
A deadlock is
a situation where in two or more competing actions are each waiting for
the other to finish, and thus neither ever does. In computer
science, Coffman deadlock refers to a specific condition when two or
more processes are each waiting for the other to release a resource, or
more than two processes are waiting for resources in a circular
chain. Deadlocks are particularly troubling because there is no general solution to avoid (soft) deadlocks.
Consider a following bridge crossing example: more...
Consider a following bridge crossing example: more...





0 comments:
Post a Comment