Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sendin...
Saved in:
| Published in: | Proceedings of the 16th International Conference on Distributed Computing Systems pp. 613 - 619 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
1996
|
| Subjects: | |
| ISBN: | 9780818673993, 0818673990 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

