Deadlock Detection: Difference between revisions
From CasGroup
Jump to navigationJump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
Distributed '''deadlock detection''' algorithms realize deadlock detection in a [[Distributed System|distributed system]]. | Distributed '''deadlock detection''' algorithms realize deadlock detection in a [[Distributed System|distributed system]]. | ||
It is difficult to detect deadlocks in distributed systems, because in general no node or process has complete information | It is difficult to detect deadlocks in distributed systems, because in general no node or process has complete information | ||
Latest revision as of 16:40, 11 February 2011
Distributed deadlock detection algorithms realize deadlock detection in a distributed system. It is difficult to detect deadlocks in distributed systems, because in general no node or process has complete information about every process. A large variety of algorithms exist, for instance the ones proposed by
- Chandy-Misra-Haas (1983)
- Bracha-Toueg (1984)
