A comparative of distributed dead-lock detection algorithms
Deadlock detection is an important problem in any distributed systems and much attention has been devoted to it in the research community. Although many deadlock detection algorithms have been proposed for distributed systems, their performance evaluation has not received sufficient attention. This...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/6627 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | Deadlock detection is an important problem in any distributed systems and much attention has been devoted to it in the research community. Although many deadlock detection algorithms have been proposed for distributed systems, their performance evaluation has not received sufficient attention. This thesis is a comparative analysis of five deadlock detection algorithms in a distributed system. This thesis gives a survey of the five selected algorithms, discusses their merits and drawbacks, and compare their performance. Moreover, this thesis will give the proof of correctness of the algorithms. A new deadlock detection algorithm for a distributed system designed by the group will also be included along with its proof of correctness. |
|---|