genpark Distributed Deadlock Wait-For-Graph Detector Skill
This MCP server implements real-time Tarjan SCC cycle detection over lock Wait-For-Graphs. It is associated with a “victim transaction arbitrator,” indicating it supports identifying cycles and selecting a victim transaction as part of deadlock handling. The server is described by its slug and name: io.github.alphaparkinc/genpark-distributed-deadlock-wait-for-graph-detector-skill.
🛠️ Key Features
- Real-time deadlock detection
- Tarjan Strongly Connected Components (SCC) cycle detection
- Operates on lock Wait-For-Graphs
- Victim transaction arbitrator for cycle resolution
🚀 Use Cases
- Detecting deadlocks in distributed systems using Wait-For-Graphs
- Finding cycle structures within lock dependency relationships
- Supporting victim selection when a deadlock is identified
⚡ Developer Benefits
- Explicit, cycle-focused SCC detection via Tarjan’s algorithm
- Clear linkage to lock Wait-For-Graph inputs
- Deterministic structure for deadlock identification and victim arbitration
⚠️ Limitations
- Only described at the level of SCC cycle detection and victim arbitration; no additional tooling, protocol methods, or configuration details are provided.