Improve deadlock detection
Open
performance
- Dominant language
- C
- Stars
- 12.8k
- Forks
- 794
- Avg merge
- 2d 14h
- Merged PRs (30d)
- 31
Description
Checking if there is a distributed deadlock comes down to finding a cycle in a directed graph. It seems that our current algorithm for finding a cycle in graph is roughly O(V^2) yet it could be O(V+E).
Contributor guide
Assessment
This issue has not been assessed yet.