An efficient distributed deadlock detection algorithm /
Abstract: "This paper proposes a distributed deadlock detection algorithm, which detects all deadlocks efficiently by synchronizing concurrent deadlock detection activities. Compared to the algorithms known to be most efficient which require O(ne) messages to detect all deadlocks in the syste...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1992]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
92-001. |
| Subjects: |
| Summary: | Abstract: "This paper proposes a distributed deadlock detection algorithm, which detects all deadlocks efficiently by synchronizing concurrent deadlock detection activities. Compared to the algorithms known to be most efficient which require O(ne) messages to detect all deadlocks in the system, our algorithm requires at most O(e log n) fixed-size messages, where e and n are the number of edges and nodes respectively. Moreover, every deadlock is detected by only one node which facilitates the resolution of deadlocks." |
|---|---|
| Item Description: | "January 1992." |
| Physical Description: | 19 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |