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.
|Title of host publication||Proceedings - IEEE INFOCOM|
|Number of pages||10|
|Publication status||Published - 1 Jan 1987|
|Name||Proceedings - IEEE INFOCOM|
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering