Abstract
Two algorithms for deadlock detection and resolution are presented. The first is based on a fully distributed approach where the messages are of fixed size and contain a pair of transaction nodes. The second one is a partially distributed scheme using a global detector wherein transactions and resources history information is efficiently used to minimize the number of messages sent to the global detector. A deadlock resolution algorithm based on heuristics is also given.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| Publisher | IEEE |
| Pages | 77-86 |
| Number of pages | 10 |
| ISBN (Print) | 0818607688 |
| Publication status | Published - 1987 |
| Externally published | Yes |
Publication series
| Name | Proceedings - IEEE INFOCOM |
|---|---|
| ISSN (Print) | 0743-166X |