A Distributed Graph Algorithm: Knot Detection.
Abstract
A knot in a directed graph is a useful concept in deadlock detection. This paper presents a distributed algorithm based on the work of Dijkstra and Scholten to identify knot in a graph by using a network of processes. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1982
- Accession Number
- ADA120126
Entities
People
- J. Misra
- K. M. Chandy
Organizations
- University of Texas at Austin