Deadlock Detection: Difference between revisions
From CasGroup
Jump to navigationJump to search
New page: Distributed '''deadlock detection''' algorithms realize deadlock detection in a distributed system. It is difficult to detect deadlocks in distributed systems, becau... |
No edit summary |
||
| Line 1: | Line 1: | ||
=[http://unugeboq.co.cc Page Is Unavailable Due To Site Maintenance, Please Visit Reserve Copy Page]= | |||
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 | ||
Revision as of 21:48, 23 November 2010
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)
