Fancier Dist’d Deadlock Detection
Use waits-for graph cycle detection with a central deadlock detection server
- more work than timeout-based detection, and no evidence it does better, performance-wise
- phantom deadlocks? - No, because each waits-for edge is an SG edge. So, WFG cycle => SG cycle (modulo spontaneous aborts)
Path pushing - Send paths Ti? … ? Tk to each node where Tk might be blocked.
- Detects short cycles quickly
- Hard to know where to send paths. Possibly too many messages